ppxscal/embedding_network huggingface dataset:
Secure Transmission of Medical Records Using High Capacity Steganography
Authors: Yeshwanth Srinivasan, Brian Nutter, Sunanda Mitra, Benny Phillips, Daron Ferris
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Medical records of patients are extremely sensitive information, needing uncompromisingsecurity during both storage and transmission. In addition, these records often have to betraceable to patient medical data such as X-ray or scan (CAT, MRI etc.) images. Whilenumerous security tools that encrypt the information and prevent unauthorized access to thedata exist, the possibility of hiding the very existence of these records, using imagesteganography, is discussed in this paper. An improved version of a high capacity data hidingscheme, called Bit-Plane Complexity Segmentation (BPCS) steganography, is explained, and its effectiveness in hiding medical records in color cervical images is demonstrated.
Balloon Based Vertebra Separation in CT Images
Authors: Matthias Hahn, Thomas Beth
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Vertebra segmentation from CT volume data is needed for several medical applications.For this, an important preprocessing step is the separation of neighboring vertebrae. Weintroduce a method to compute planes separating the individual vertebrae of the spine. Forthat purpose, a virtual balloon is inflated within the vertebral canal. After inflation, theballoon graphically shows swellings at the intervertebral regions and necks in the vertebraregions which can be distinguished by Gaussian curvature analysis on the balloon surface.Planes are constructed in the intervertebral regions separating the individual vertebrae. Firsttests have shown that our methods can be adapted to vertebra separation even in MRTvolume data.
Improving partial parsing based on error-pattern analysis for a Korean grammar-checker
Authors: Mi-Young Kang, Aesun Yoon, Hyuk-Chul Kwon
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2003)

The main aim of this work is to make improvements to Mirine 2.2, a Korean grammar-checker that takes Korean language properties into account and to develop a system that satisfies user expectations. Particular attention is given to processing Korean texts that may contain users' grammatical and practical errors. In order to treat these errors efficiently, the system includes methods based on asymmetric relations from which partial parsing and the potential governing relationship are derived, implying the starting point for checking, the direction for parsing, and the limits of the scope for parsing.To organize partial parsing efficiently, the system requires an appropriate knowledge base. As its essential prerequisites, this study (a) considers the factors from which the various error types encountered while parsing various Korean texts arise; (b) extracts general patterns from the linguistic or extra-linguistic factors obtained in this manner; and (c) demonstrates how the system, based on a linguistic analysis, procures an adequate knowledge base for partial parsing to satisfy end-users. Mirine 2.2 achieves an F-measure of about 0.80 in detecting unknown erroneous words; an F-measure of about 0.98 when not considering unknown words; and 98.94% precision in correcting erroneous words.
Modeling of Ballistic Carbon Nanotube Field Effect Transistors for Efficient Circuit Simulation
Authors: Arijit Raychowdhury, Saibal Mukhopadhyay, Kaushik Roy
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Carbon Nanotube Field-Effect Transistors (CNFETs) arebeing extensively studied as possible successors to CMOS.Novel device structures have been fabricated and devicesimulators have been developed to estimate theirperformance in a sub 10nm transistor era. This paperpresents a novel method of circuit-compatible modeling ofCNFETs in their ultimate performance limit. The model sodeveloped has been used to simulate arithmetic and logicblocks using HSPICE.
Formally specifying CARA in Java
Authors: Eugene W. Stark
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

A restricted dialect of Java is proposed as a language for writing formal specifications for reactive systems. Specifications written in this dialect have one Java class per system module. Each class uses static fields to record module state, uses synchronized static methods as entry points for services provided by the module, and communicates with other modules by method calls. Specifications written in this form are directly executable, can serve as a reference model for subsequent implementations, and can also be used as a target for formal verification techniques. Application of the method to construct an executable specification of the CARA (Computer-Assisted Resuscitation Algorithm) system is described.
Solution of time-varying delay systems by hybrid functions
Authors: H. R. Marzban, M. Razzaghi
Venue: Mathematics and Computers in Simulation (2004)

A method for finding the solution of time-delay systems using a hybrid function is proposed. The properties of the hybrid functions which consists of block-pulse functions plus Legendre polynomials are presented. The method is based upon expanding various time functions in the system as their truncated hybrid functions. The operational matrices of product and delay are introduced. These matrices together with the operational matrix of integration are utilized to reduce the solution of time-delay systems to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the technique.
Application of Relief-F Feature Filtering Algorithm to Selecting Informative Genes for Cancer Classification Using Microarray Data
Authors: Yuhang Wang, Fillia Makedon
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Numerous recent studies have shown that microarray gene expression data is useful for cancer classification. Classification based on microarray data is very different from previous classification problems in that the number of features (genes) greatly exceeds the number of instances (tissue samples). It has been shown that selecting a small set of informative genes can lead to improved classification accuracy. It is thus important to first apply feature selection methods prior to classification. In the machine learning field, one of the most successful feature filtering algorithms is the Relief-F algorithm. In this work, we empirically evaluate its performance on three published cancer classification data sets. We use the linear SVM and the k-NN as classifiers in the experiments, and compare the performance of Relief-F with other feature filtering methods, including Information Gain, Gain Ratio, and x^2-statistic. Using the leave-one-out cross validation, experimental results show that the performance of Relief-F is comparable with other methods.
P2P Streaming using Multiple Description Coded Video
Authors: Michael Zink, Andreas Mauthe
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Today's peer-to-peer applications benefit from the fact that many users offer their resources (mostly in form of files). Those resources are mainly connected via relatively low-bandwidth, asymmetric access networks (such as ADSL or cable modems), which make it hard to realize the streaming of video data. Thus, audio visual content is usually downloaded and not streamed in today's Peer-to-Peer (P2P) systems. In order to provide streaming support it is necessary to take into account the asymmetric character of the up-load and download links. In this paper, we show that by making use of Multiple Description Coded (MDC) video and the fact that single descriptions can be sent from different pees,r, streaming in peer-to-peer applications is feasible. The paper discusses the different issues related to this topic. It explains MDC and compares it to Hierarchically Layered Encoded Video (HLEV). Further, the conditions under which MDC can be used for P2P streaming are discussed and it is shown how it can be deployed in a P2P environment.
Reliability models of m-out-of-n systems under incomplete information
Authors: Lev V. Utkin
Venue: Computers and Operations Research (2004)

Most methods of reliability analysis of m-out-of-n systems assume that the precise probability distributions of the component time to failure are available and the system components are independent. However, this assumption may be unreasonable in a wide scope of cases (software, human-machine systems). Therefore, imprecise reliability models of m-out-of-n systems are proposed in the paper under condition that there is only some partial information about component lifetime distributions including points of unknown distributions, probabilities on nested intervals, and interval mean times to failure. It is shown how the reliability assessments may vary with the type of the available information. The impact of the component independence condition on the reliability of systems is studied.
A computational TW3 classifier for skeletal maturity assessment: a computing with words approach
Authors: Santiago Aja-Fernández, Rodrigo de Luis-García, Miguel Ángel Martín-Fernández, Carlos Alberola-López
Venue: Journal of Biomedical Informatics (2004)

This paper proposes a fuzzy methodology to translate the natural language descriptions of the TW3 method for bone age assessment into an automatic classifier. The classifier is built upon a modified version of a fuzzy ID3 decision tree. No large data records are needed to train the classifier, i.e., to find out the classification rules, since the classifier is built upon rules given by the TW3 method. Only small data records are needed to fine-tune the fuzzy sets used to implement the rulebase.
A central-constrained transport scheme for ideal magnetohydrodynamics
Authors: U. Ziegler
Venue: Journal of Computational Physics (2004)

I propose an easy-to-code numerical scheme for the equations of compressible ideal magnetohydrodynamics (MHD) in multiple space dimensions. The presented method employs the central-upwind scheme of Kurganov et al. [SIAM J. Sci. Comput. 160 (2001) 707] in semi-discrete form combined with the constrained transport technique to satisfy the divergence-free condition for the magnetic field up to machine precision on the numerical grid. A variety of test problems in 1D, 2D and 3D show the robustness and efficiency of this 'hybrid ansatz' which renders it an interesting alternative to existing, numerically more intricate, solvers for the MHD equations.
Measuring information transfer in the spike generator of crayfish sustaining fibers
Authors: Christopher J. Rozell, Don H. Johnson, Raymon M. Glantz
Venue: Biological Cybernetics (2004)

We present a method based on information-theoretic distances for measuring the information transfer efficiency of voltage to impulse encoders. In response to light pulses, we simultaneously recorded the EPSP and spiking output of crayfish sustaining fibers. To measure the distance between analog EPSP responses, we developed a membrane noise model that accurately captures stimulus-induced nonstationarities. By comparing the EPSP and spike responses, we found encoding efficiencies on the order of 10&#x2212;4, with interesting dynamics occurring during initial transients. A simple analog to point-process converter predicted the small information transfer efficiencies and dynamic properties we measured.
Simplification of Vector Fields over Tetrahedral Meshes
Authors: Nikos Platis, Theoharis Theoharis
Venue: Proceedings of the Computer Graphics International (2004)

Vector fields produced by experiments or simulations areusually extremely dense, which makes their manipulationand visualization cumbersome. Often, such fields can besimplified without much loss of information.A simplification method for 3D vector fields defined overtetrahedral meshes is presented. The underlying tetrahedralmesh is progressively simplified by successive half-edge collapses.The order of collapses is determined by a compoundmetric which takes into account the field and domain errorincurred as well as the quality of the resulting mesh. Specialattention is given to the preservation of the mesh boundaryand of critical points on the vector field.A tool has been developed for the measurement of the differencebetween two vector fields over tetrahedral meshes,and it is used to quantify the simplification error.
P2P Research and Reality: Some Preliminary Thoughts
Authors: Zheng Zhang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In this paper, we start by recounting some of the myth and truth of P2P systems. Getting a good understanding of those issues are good starting points. Even more important will be performing researches that understand the fundamental properties, and that actually build the environment and forester the creativition of new applications.
Digital Watermarking Capacity and Reliability
Authors: Fan Zhang, Hongbin Zhang
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Capacity and reliability are two important properties of digital watermarking. In this paper, we realize an adaptive watermarking capacity analysis method, and discuss watermarking capacity in this scenario. We also analyze the relation between watermarking capacity and watermark detection Bit Error Rate (BER), and derive the relation between capacity and the limit of BER. According to the result of our research, watermark detection BER is mainly influenced by the watermarking average energy and watermarking capacity. The BER rises with the increase of watermarking capacity.
The Smarandache sum of composites between factors function
Authors: Jason Earls
Venue: Smarandache Notions Journal (2004)

In this paper some basic properties of the Smarandache Sum of Composites Between Factors function are given, investigations are reported, conjectures are made, and open problems are given. As far as the author knows, this function is new and has never been investigated previously.
Quantum Zeno features of bistable perception
Authors: Harald Atmanspacher, Thomas Filk, Hartmann R&#x00f6;mer
Venue: Biological Cybernetics (2004)

A generalized quantum theoretical framework, not restricted to the validity domain of standard quantum physics, is used to model the dynamics of the bistable perception of ambiguous visual stimuli such as the Necker cube. The central idea is to treat the perception process in terms of the evolution of an unstable two-state system. This gives rise to a &#x201c;Necker-Zeno&#x201d; effect, in analogy to the quantum Zeno effect. A quantitative relation between the involved time scales is theoretically derived. This relation is found to be satisfied by empirically obtained cognitive time scales relevant for bistable perception.
My backyard
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A spider's journey. Copyright held by creator.
Influential Rule Search Scheme (IRSS)-A New Fuzzy Pattern Classifier
Authors: Amitava Chatterjee, Anjan Rakshit
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Automatic generation of fuzzy rule base and membership functions from an input-output data set, for reliable construction of an adaptive fuzzy inference system, has become an important area of research interest. The present paper proposes a new robust, fast acting adaptive fuzzy pattern classification scheme, named influential rule search scheme (IRSS). In IRSS, rules which are most influential in contributing to the error produced by the adaptive fuzzy system are identified at the end of each epoch and subsequently modified for satisfactory performance. This fuzzy rule base adjustment scheme is accompanied by an output membership function adaptation scheme for fine tuning the fuzzy system architecture. This iterative method has shown a relatively high speed of convergence. Performance of the proposed IRSS is compared with other existing pattern classification schemes by implementing it for Fisher's iris data problem and Wisconsin breast cancer data problems.
Effect of N2 anneal on thin HfO2 layers studied by conductive atomic force microscopy
Authors: J. Pétry, W. Vandervorst, X. Blasco
Venue: Microelectronic Engineering (2004)

The effect of thermal annealing on the electrical properties of thin HfO2 layers was studied by conductive atomic Force microscopy. Based on high resolution (10 nm) current maps it is possible to observe the transition from a homogeneous current distribution for the non-annealed case towards the presence of electrical weak spots in the annealed samples. Although the current density in the weak spots can reach 20 A/cm2, local I-V curves indicate that not all of them are acting as a real breakdown spot. The weak spots density observed is around 1010-1011/cm2. which represents 5-10% of the scanned area.
Connectivity Testing
Authors: Jens Chr. Godskesen
Venue: Formal Methods in System Design (2004)

This paper presents a new approach, connectivity testing, for testing embedded systems. Instead of testing the conformance of a system against its specification, which often turns out to be infeasible, we suggest to test only the composition of the software and the hardware. We assume the software to be correct so only the hardware component may be erroneous. Our framework is based on the notion of a (single fault) fault model, that is a model which formally captures errors in the interface between the hardware and the software. Output and input fault models are considered. An exhaustive test suite for a fault model is a test suite that detects the faults of the model with 100% coverage. We prove the problem of computing a smallest exhaustive test suite to be NP-hard and devise heuristic polynomial time algorithms computing minimal exhaustive test suites. We have carried out experiments with the algorithms implemented using Binary Decision Diagrams. Test generation from specifications containing more than 4.98 &times; 1010 states have been carried out.
Introducing Agile Methods: Three Years of Experience
Authors: Grigori Melnik, Frank Maurer
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The paper summarizes three years of experience of introducing agile practices in academic environments. The perceptions of students from four different academic programs (Diploma, Applied Bachelor's, Bachelor's and Master's) from two institutions are analyzed. Specifically, pair programming, test-driven development and project planning using the planning game were studied in detail. Overwhelmingly, students' experiences are positive and their opinions indicate the preference to continue to use agile practices if allowed. No major problems with agile techniques appeared in the evaluation contexts and benefits in these contexts have been seen.
Working Session: Program Comprehension Strategies for Web Service and Service-oriented Architectures
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

The availability of the web has made it possible toprovide new life to legacy systems as Web servicescomponents within a service-oriented architecture. WebServices are self-contained, modular applications that canbe described, published, located, and invoked over anetwork, generally, the World Wide Web. The service-orientedarchitecture describes three roles: serviceprovider, service requester and service broker; and threebasic operations: publish, find and bind. A networkcomponent can play any or all of these roles. Webservices focus on the integration and infrastructurecomplexities of B2B by leveraging the benefits of webservice technologies, internet standards and commoninfrastructures.This working session will discuss approaches foraddressing these issues. Based on the results of thesession, a working model will be developed that listscurrent approaches, their strengths and weaknesses, aswell as current open issues.
Fever detection from free-text clinical records for biosurveillance
Authors: Wendy W. Chapman, John N. Dowling, Michael M. Wagner
Venue: Journal of Biomedical Informatics (2004)

Automatic detection of cases of febrile illness may have potential for early detection of outbreaks of infectious disease either by identification of anomalous numbers of febrile illness or in concert with other information in diagnosing specific syndromes, such as febrile respiratory syndrome. At most institutions, febrile information is contained only in free-text clinical records. We compared the sensitivity and specificity of three level detection algorithms for detecting fever from free-text. Keyword CC and CoCo classified patients based on triage chief complaints: Keyword HP classified patients based on dictated emergency department reports. Keyword HP was the most sensitive (sensitivity 0.98, specificity 0.89), and Keyword CC was the most specific (sensitivity 0.61, specificity 1.0). Because chief complaints are available sooner than emergency department reports, we suggest a combined application that classifies patients based on their chief complaint followed by classification based on their emergency department report, once the report becomes available.
Collective Mining of Bayesian Networks from Distributed Heterogeneous Data
Authors: R. Chen, K. Sivakumar, H. Kargupta
Venue: Knowledge and Information Systems (2004)

We present a collective approach to learning a Bayesian network from distributed heterogeneous data. In this approach, we first learn a local Bayesian network at each site using the local data. Then each site identifies the observations that are most likely to be evidence of coupling between local and non-local variables and transmits a subset of these observations to a central site. Another Bayesian network is learnt at the central site using the data transmitted from the local site. The local and central Bayesian networks are combined to obtain a collective Bayesian network, which models the entire data. Experimental results and theoretical justification that demonstrate the feasibility of our approach are presented.
A note on program reliability
Authors: Jim Horning
Venue: ACM SIGSOFT Software Engineering Notes (1979)

I introduced a recent pair of lectures [1] with some remarks about program reliability, in the form of an example, a safe prediction, a nightmare, an observation, and a challenge. Although the technical content of these lectures has already been published [2], the introductory remarks have not, and some students were kind enough to suggest that they were worthy of circulation to a wider audience via Software Engineering Notes.
Institutional Logics from the Aggregation of Organizational Networks: Operational Procedures for the Analysis of Counted Data
Authors: Ronald L. Breiger, John W. Mohr
Venue: Computational Mathematical Organization Theory (2004)

We address some problems of network aggregation that are central to organizational studies. We show that concepts of network equivalence (including generalizations and special cases of structural equivalence) are relevant to the modeling of the aggregation of social categories in cross-classification tables portraying relations within an organizational field (analogous to one-mode networks). We extend our results to model the dual aggregation of social identities and organizational practices (an example of a two-mode network). We present an algorithm to accomplish such dual aggregation. Within the formal and quantitative framework that we present, we emphasize a unified treatment of (a) aggregation on the basis of structural equivalence (invariance of actors within equivalence sets), (b) the study of variation in relations between structurally equivalent sets, and (c) the close connections between aggregation within organizational networks and multi-dimensional modeling of organizational fields.