ppxscal/embedding_network huggingface dataset:
Decision support communication: integrating communicative plans from multiple sources to plan messages for a dynamic user and environment
Authors: Sandra M. Carberry, Keith S. Decker
Venue:  (2007)

When computers communicate with humans to facilitate a decision process, they must do so in an unambiguous and concise manner which reflects the needs and preferences of the user, and takes into account the situation in which the system performs. This dissertation explores the fulfillment of these requirements of decision support in the context of systems that receive information from multiple, independent sources. In the first part of this thesis I present my hypothesis that independent text plans, analyzed in terms of their rhetorical structure [MT87], can be integrated to enhance conciseness and coherence. An implemented system, RTPI, demonstrates the application of this hypothesis to improve message sets generated by an existing decision support system through the integration of related messages. An evaluation of RTPI shows that it reduces repetition and overall message length, and human subjects prefer its integrated messages to the original sets of messages. The second part of this thesis explores the additional challenges presented when decision support information is obtained and integrated from multiple sources in a dynamic information environment. In this environment, information attributes such as quality, cost, length, and production time can vary over time; in addition, user preferences regarding those attributes can also change. I present my hypothesis that this problem can be computationally addressed, by a flexible, responsive, agent-based system that takes into account both user preferences and information attributes that change over time. The implemented system MADSUM demonstrates a multi-agent architecture that addresses all of these issues. An evaluation of the system's output shows that human subjects, when presented with a scenario including user preferences and information, agree with MADSUM's selection and ordering of information from a proposition set.
On an extremal problem of Selberg II
Authors: Jyoichi Kaneko
Venue: Journal of Approximation Theory (2007)

Let m"p be the minimum of the product @?"i"="1^p(1+y"i) under the conditions that y"i>0,y"1...y"p=e^1^-^p and |@?"1"=1plogm"p>0.3328392748... provided p>=255. In this note, we prove that the limit of 1plogm"p as p->~ exists and is expressed by the (unique) solution of some simultaneous transcendental equations. By using this expression we obtain lim"p"->"~1plogm"p=0.3342139570... numerically.
Statistical Variations Are Inevitable - Can We Cope With Them?
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

The ever-decreasing size of wires and transistors on VLSI chips has driven the revolution in electronics over the past several decades. The features in advanced chips are now so small that variations in numbers of photons and numbers of atoms matter. Lithography of subwavelength device dimensions and statistical variations in the numbers of dopant atoms that elicit transistor behavior result in significant variation in the electrical properties of tiny transistors. Such variations are an inevitable consequence of miniaturization revealing the quantized nature of light and matter.
Using portfolio theory for better and more consistent quality
Authors: Ken Koster
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

The effectiveness of software quality techniques varies. Many uncertain or unpredictable factors influence effectiveness, including human factors, the types of defects in the program, and luck. Compared to using a single quality technique, a diversified portfolio of techniques will typically be more effective and less variable. This work postulates a simple model, adapted from financial Modern Portfolio Theory, for the variability and effectiveness of techniques, singly and in portfolios. Proofs and simulations analyze the model to evaluate factors influencing the success of diversification; the model is checked against data sets from previous work.
Biologically inspired intelligent fault diagnosis for power distribution systems
Authors: Mo-Yuen Chow
Venue:  (2006)

Power distribution systems have been significantly affected by a wide range of fault-causing events; and the current outage restoration procedure may take from tens of minutes to hours. Effective outage cause identification can help to expedite the outage restoration and consequently improve the system reliability. Most current researches are based on system modeling and measurements such as voltage and current; besides, they usually target at a single feeder or a small system due to the difficulty of modeling the large-scale, nonlinear, and time-varying distribution system. In this research, various data mining approaches including statistical methods and artificial intelligence algorithms have been investigated and applied to Duke Energy distribution outage data in order to extract the outage pattern and identify the outage cause; by this means, the additional environmental information recorded in the data can be adopted in the fault diagnosis and the analysis range can be beyond the scope of a single feeder or a small system. Also, the affect of data imperfections such as data noise, data insufficiency, especially the data imbalance issue on the performance of outage cause identification have been investigated. In this work, logistic regression and artificial neural network are firstly compared on their capability in fault diagnosis; then an existing fuzzy classification algorithm is extended to E-algorithm to alleviate the effect of data imbalance; afterwards, the immune system based Artificial Immune Recognition System (AIRS) algorithm is investigated for its capability in fault diagnosis using real-world data; lastly, a hybrid algorithm based on E-algorithm and AIRS is proposed to embed the rule extraction capability while performing satisfactory fault cause identification.
Image processing using singularities and wavelets
Authors: A. Z. R. Langi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The paper develops a singularity image model as an alternative to linear models for processing many complicated but important images. The model is effective because it provides image characterization, image decomposition, and image reconstruction. For a given measure, one can nonlinearly transform an image into a singularity domain, where each pixel has a singular coefficient. For everywhere singular images, the coefficients are equivalent to fractal dimensions. The image can be decomposed (or partitioned) into subimages such that pixels in each subimage have the same singularity coefficients. Since each subimage is fractal, the overall image can have singularity spectrum. For a wavelet-based measure, it is possible to reconstruct the image from the singularity information. The paper shows application examples including image denoising, image compression, and analysis of natural and biomedical images.
Interfacing PC-based MATLAB Directly to HPC Resources
Authors: John Nehrbass, Siddharth Samsi, Juan Carlos Chaves, Jose Unpingco, Brian Guilfoos, Stanley Ahalt, Ashok Krishnamurthy, Alan Chalker, Judy Gardiner
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Many DoD HPC users, particularly in the SIP area, run codes developed with MATLAB and related applications (MatlabMPI, StarP, pMatlab, etc.). There is a desire to run codes from a desktop instance of MATLAB and connect to and interact with codes running on HPC resources. The PET SIP team has developed and demonstrated technology that makes this possible. The SSH toolbox for MATLAB enables users to connect to and use HPC resources using SSH without leaving the MATLAB environment. The toolbox uses a freely available implementation of SSH, a modified version of which is also used by the DoD HPCMP. The SSH toolbox consists of a Windows DLL written in C, which is used by MATLAB to communicate with the SSH client. The toolbox provides simple MATLAB commands for users to connect to remote resources, run code, retrieve results and end the SSH session. The complexity of the DLL interface and most of the security needs are hidden from the user, making this a very easy to use and powerful toolbox. Since the main component of the toolbox is written is C and packaged as a DLL, the toolbox can also be extended to work with other programming languages such as Java, Python and Octave. MATLAB-style documentation for the toolbox also makes it easy to obtain help on various aspects of the toolbox and a GUI-based installer makes distribution easier. This technology provides a revolutionary way of providing support to the DoD. Software developers are now able to provide all the hooks to a complicated HPC environment, thus removing the burden of end users.
Intuitionistic Fuzzy Automata and Associated Fuzzy Topologies
Authors: Arun K. Srivastava, S. P. Tiwari
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

It is shown that two intuitionistic fuzzy topologies can be associated with an intuitionistic fuzzy automata which have interesting relationships with the topologies introduced in [9] for fuzzy automata.
An Interactive Web-based HPC Reservation System
Authors: Randy N. Schauer, Steven R. Thompson
Venue: Proceedings of the HPCMP Users Group Conference (2006)

For years, while the vast majority of users at the DoD HPCMP MSRC's and DC's were serviced well by batch job queuing systems, a small minority of users, because their computing needs did not mesh well with the batch queuing system paradigm, kept asking for interactive access to the HPC machines. To address this need, in May 2005, the 256 processor ARL MSRC Linux Networx cluster, Powell, was transitioned to interactive use. Since no large HPCMP machine had operated this way before, a new approach that would regulate interactive usage in an automated fashion was needed. In response to that, the ARL MSRC has developed a web-based reservation tool so that users may make advance reservations for nodes on Powell.
Automatic extraction of time-frequency skeletons with minimal spanning trees
Authors: O. Michel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Theoretical results have been established in non-parametric entropy estimation, based on asymptotic properties of minimal spanning trees (MST). A new application is proposed for the automatic extraction of time-frequency skeletons in the case of multicomponent chirp-like signals. The proposed method makes use of local maxima of a time-frequency distribution (considered as realizations of a 2D or 3D process), and exploits the efficiency of MSTs for density discrimination and clustering.
A journey through the FIE bookshelf-1971-2000
Authors: T. W. Schultz
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In 1971, about 100 engineering educators from industry, and academia gathered in Atlanta for the first Frontiers in Education (FIE) conference. Its leaders had a vision, and moved creatively to implement the vision. The journey through the conferences, which we call FIE, is worth documenting, as the conference has become a premier and often imitated conference. Some educators have been involved right from the beginning and continue. Others have disembarked, but many new contributors have joined. The paper documents some data. The paper is also an attempt to study the impact of the conference on engineering education over the last 30 years. What issues have been resolved? What new issues have emerged? What issues continue? What might emerge in the future? Of necessity, it contains some personal observations. 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
A novel method for determining Young's modulus of thin films by micro-strain gauges
Authors: Chen Shi-Hao
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

This work presents a novel method for determining Young's modulus of thin films with compact micromachined test structures and without using any extra load. The test structures comprise of a pair of micro-strain gauges and a cantilever beam. An analytical model is derived to extract the Young's modulus of test structures. Notably, both Young's modulus and residual stress can be simultaneously determined; thus we can correlate Young's modulus and residual stress. The micromachined test structures employed in the measurement are made of low-pressure chemical-vapor deposition (LPCVD) undoped polycrystalline silicon films. A conventional surface-sacrificial layer micromachining technique with one mask is used to fabricate the structures. The obtained Young's modulus is reduced a little as residual stress increases. The average value of the obtained Young's modulus is 169 G Pa, and the residual stress calibrated from the strain gauge is 211 MPa. 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
Latency Analyses of CC-NUMA and CC-COMA Rings
Authors: Xiaodong Zhang, Yong Yan
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper focuses comparative performance modeling and evaluation of CC-NUMA and CC-COMA on a hierarchical ring shared-memory architecture. Intensive performance measurements of the two models have been conducted on the KSR-1. The experimental results support the analytical models, and present practical observations and comparisons of the two cache coherence memory systems. Our analytical and experimental results show that a CC-COMA system balances the work load well. However the overhead of frequent data movement may match the gains obtained from improving load balance. Although a CC-NUMA system may not automatically balance the load at the system level, it provides an option for a user to explicitly handle data locality for a possible performance improvement.
The Case of Honda: A Dialectical yet Coherent Firm
Authors: W. David Holford, Mehran Ebrahimi
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This conceptual paper proposes that Honda's innovative prowess of producing both radical and disruptive innovations within their aerospace and automotive/pick-up truck development activities can be traced back to its organizational culture of continually embracing opposites or contradiction across dialectical synthesis. It is this synthesis of various "contradictions' or viewpoints that gives the firm and its resulting disruptive innovations the simultaneous characteristic of continuity and novelty. Such a pattern was discerned across second hand data related to the development of the HondaJet and Ridgeline; and appears to confirm both Nonaka and Toyama's thesis of the dialectical firm, as well as Christensen's thesis of the feasibility of producing distinctive innovations at relatively low costs. Key organizational enablers towards attaining such an organizational reality requires management focus on nurturing mutual trust, care, empathy, redundancy of information and requisite variety.
Type safe dynamic linking for JVM access control
Authors: Christian Skalka
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

The Java JDK security model provides an access control mechanism for the JVM based on dynamic stack inspection. Previous results have shown how stack inspection can be enforced at compile time via whole-program type analysis, but features of the JVM present significant remaining technical challenges. For instance, dynamic dispatch at the bytecode level requires special consideration to ensure flexibility in typing. Even more problematic is dynamic class loading and linking, which disallow a purely static analysis in principle, though the intended applications of the JDK exploit these features. We propose an extension to existing byte-code verification, that enforces stack inspection at link time, without imposing new restrictions on the JVM class loading and linking mechanism. Our solution is more flexible than existing type based approaches, and establishes a formal type safety result for bytecode-level access control in the presence of dynamic class linking.
Environment of Intellect: 7 Issues We Need to Think about for the Future
Authors: Yoshinobu Tonomura
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

We are now in a technologically rich environment such as broadband Internet, mobile phones, and high-performance personal computers. However, along with high expectations for future technology and services, concerns about the possibility of serious trouble in the future have recently arisen. For example, the concern that we cannot keep up with the rapid changes in our environment and the technologies that underpin our way of life, the unexpected risks posed by cyberspace, and the onslaught of unwanted information that threatens to bury us.
Comparison of cyclic moments-based estimators of the parameters of random amplitude polynomial phase signals
Authors: M. R. Morelande
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

It has been suggested that the accuracy of the cyclic moments-based estimator of the frequency of a random amplitude sinusoid in additive noise may be increased by using the squared observations rather than the raw observations. This paper extends this idea to random amplitude polynomial phase signals of arbitrary order. The covariance matrix of the cyclic moments-based estimators is derived for the cases where either the observations or the squared observations are used. It is found that, for first and second order phases, the use of the squared observations results in more accurate phase parameter estimates in a wide range of conditions. For higher order phases the use of the squared observations is more accurate only under restrictive conditions.
A characterization of quintic helices
Authors: J. V. Beltran, J. Monterde
Venue: Journal of Computational and Applied Mathematics (2007)

A polynomial curve of degree 5, @a, is a helix if and only if both @?@a^'@? and @?@a^'@?@a^''@? are polynomial functions.
Performance Evaluation of Privacy-Preserving Policy Reconciliation Protocols
Authors: Jonathan Voris, Sotiris Ioannidis, Susanne Wetzel, Ulrike Meyer
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

The process of policy reconciliation allows multiple parties with possibly different policies to resolve differences in order to reach an agreement on an acceptable policy. Previous solutions for policy reconciliation required the participants to reveal their entire security policy in order to reach an agreement. It was not until recently that new protocols were developed which take into account the privacy concerns of reconciliating parties. In this paper we present a performance evaluation of these privacy-preserving reconciliation protocols with a focus on quantifying the added cost due to the privacy guarantees.
Managing Trustworthiness in Component-based Embedded Systems
Authors: Gabriele Lenzini, Andrew Tokmakoff, Johan Muskens
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Component-based systems use software components to achieve their overall high-level functionality which, in turn, may be extended by initiating the download of new components. This action may detrimentally affect the system's overall dependability and security characteristics. We address the problem of the enhancement of dependability and security for component-based embedded systems that run, for example, in consumer and embedded electronics devices. We propose a Trustworthiness Management Framework which, while acting on the behalf of components (Trustors), supervises the system's existing Trustor-Trustee relationships and preserves the overall system level of dependability and security. This is achieved by monitoring quality metrics on the components behaviours, by periodically evaluating their trustworthiness, and (when applicable) by controlling them. This paper focuses on the trustworthiness evaluation process offered by the Trustworthiness Management Framework. Trustworthiness evaluation is seen as a Trustors-parameterisable function. Trustworthiness is expressed with a triple of values: compliance, benignity and stability. The first measures the degree to which a component satisfies the Trustor's requirement; the second and third express the expected belief that, resp., the components will continue to be compliant and the component's behavioural qualities will remain stable. Trustworthiness is used by the Trustworthiness Manager Framework to make control decisions to regulate the system's overall dependability and security characteristics. Keywords: component-based systems, trustworthiness evaluation, trustworthiness management architecture, dependability and security.
Statistical models of sequencing error and algorithms of polymorphism detection
Authors: Lei Li
Venue:  (2006)

Estimation of the sequencing error patterns is the key to accuracy improvement in DNA sequencing. In chapter 2, with probabilistic interpretation of the quality value, we propose a conditional sequencing error model. In chapter 3, we model the sequencing errors by a mixture of multinomials and a mixture of logistic regressions. In these models, the underlying DNA target is unknown and treated as missing data. The redundancy in the assembly allows us to impute the missing data by an EM algorithm. In the mixture of logistic regressions, we use piecewise linear functions of the quality value to deal with nonlinear effects. We evaluate the models with different knots by AIC and single base discrepancy and use a backward elimination algorithm for model selection. We apply these methods to a whole genome assembly, C. jejuni , and improve the accuracy of consensus sequence by a great deal. Based on the predicted sequencing error patterns, we correct the bias in the quality value and assign to base-calls new quality values with probabilistic interpretation. We also make an effort to expand this model by including more covariates, such as GC content. These statistical models provide a framework for the analysis of sequence assembly and can directly be applied to the daily practice of DNA sequencing. Polymorphism detection in the resequencing data is especially important for linkage analysis and association study. We propose a novel method for trace preprocessing and spike alignment to identify polymorphism accurately. In chapter 4, we introduce a procedure to preprocess DNA sequencing traces and recover signal spike trains in five steps: color correction, normalization, baseline subtraction, width estimation, and deconvolution. In chapter 5, we describe the dynamic programming algorithm for spike alignment, and demonstrate the polymorphism detection from the alignment. Based on this method, we develop a software with graphical user interface for resequencing data and made it available to the public. Our software offers a new perspective for polymorphism detection, especially insertion-deletion polymorphism in mononucleotide runs.