ppxscal/embedding_network huggingface dataset:
Ensemble Learning for Chemical Sensor Arrays
Authors: S. Bermejo, J. Cabestany
Venue: Neural Processing Letters (2004)

Electrochemical sensors, like ion-selective field transistors (ISFET), are electronic devices that merge solid-state electronic technology with chemical sensors so as to be sensitive to the concentration of a particular ion in a solution. However, as it has been previously reported, their response does not only depend on a single ion but also is affected by several interfering ions found in the solution to be measured. These interfering ions can be considered as noise and consequently, a post-processing stage that increases the SNR is obligatory. Our work shows how ensemble learning methods could be used in an array of chemical sensors in order to deal with this problem. In particular, we introduce a novel neural learning architecture for ISFET arrays, which employ ISFET models as prior knowledge. The proposed ensemble learning systems are RBF-like solutions based on bagging and optimal linear combination. Several experimental results are included, which demonstrate the interest and viability of the proposed solution.
Formal specifications design, evolution and reuse
Authors: Ferhat Khendek, Gregor v. Bochmann
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

The effort for designing specifications for complex systems is tremendous. Moreover, specifications may evolve in order to accommodate new requirements, such as the addition of new functionality. Each added functionality may interfere with many existing ones. Therefore, approaches to cope with the design and the evolution of specifications are needed. In this paper, we summarize our results for formal specification design, evolution and reuse.
Intersecting Chains in Finite Vector Spaces
Authors: Éva Czabarka
Venue: Combinatorics, Probability and Computing (1999)

We prove an Erd&ouml;s&ndash;Ko&ndash;Rado-type theorem for intersecting k-chains of subspaces of a finite vector space. This is the q-generalization of earlier results of Erd&ouml;s, Seress and Sz&eacute;kely for intersecting k-chains of subsets of an underlying set. The proof hinges on the author's proper generalization of the shift technique from extremal set theory to finite vector spaces, which uses a linear map to define the generalized shift operation. The theorem is the following.For c = 0, 1, consider k-chains of subspaces of an n-dimensional vector space over GF(q), such that the smallest subspace in any chain has dimension at least c, and the largest subspace in any chain has dimension at most n &minus; c. The largest number of such k-chains under the condition that any two share at least one subspace as an element of the chain, is achieved by the following constructions:(1) fix a subspace of dimension c and take all k-chains containing it,(2) fix a subspace of dimension n &minus; c and take all k-chains containing it.
Spectral/hp least-squares finite element formulation for the Navier-Stokes equations
Authors: J. P. Pontaza, J. N. Reddy
Venue: Journal of Computational Physics (2003)

We consider the application of least-squares finite element models combined with spectral/hp methods for the numerical solution of viscous flow problems. The paper presents the formulation, validation, and application of a spectral/ hp algorithm to the numerical solution of the Navier-Stokes equations governing two- and three-dimensional stationary incompressible and low-speed compressible flows. The Navier-Stokes equations are expressed as an equivalent set of first-order equations by introducing vorticity or velocity gradients as additional independent variables and the least-squares method is used to develop the finite element model. High-order element expansions are used to construct the discrete model. The discrete model thus obtained is linearized by Newton's method, resulting in a linear system of equations with a symmetric positive definite coefficient matrix that is solved in a fully coupled manner by a preconditioned conjugate gradient method. Spectral convergence of the L2 least-squares functional and L2 error norms is verified using smooth solutions to the two-dimensional stationary Poisson and incompressible Navier-Stokes equations. Numerical results for flow over a backward-facing step, steady flow past a circular cylinder, three-dimensional lid-driven cavity flow, and compressible buoyant flow inside a square enclosure are presented to demonstrate the predictive capability and robustness of the proposed formulation.
Forecasting software in practice: use, satisfaction, and performance
Authors: Nada R. Sanders, Karl B. Manrodt
Venue: Interfaces (2003)

Using survey data from 240 US corporations, we evaluated practitioners' use and satisfaction with forecasting software and its performance. Despite the many commercial forecasting software packages, only 10.8 percent of the respondents reported using them. Forty-eight percent reported using spreadsheets to make forecasts. Sixty percent reported being dissatisfied with forecasting software. However, we found that those who used commercial forecasting software packages had the best forecast performance, as measured by mean absolute percentage error (MAPE). Those using commercially available packages had errors 6.7 percent lower than those using spreadsheets and 17.2 percent lower than those who used no program. Also, they were more satisfied with their software than those using spreadsheets. In fact, users of forecasting software programs reported a 12.2 percent reduction in forecast error. We found that 61 percent of respondents routinely adjusted forecasts produced by software based on their judgment. Roughly 85 percent of respondents considered ease of use and easily understandable results the most important software features.
Ellipsoidal Approach to Box-Constrained Quadratic Problems
Authors: Pasquale L. De Angelis, Immanuel M. Bomze, Gerardo Toraldo
Venue: Journal of Global Optimization (2004)

We present a new heuristic for the global solution of box constrained quadratic problems, based on the classical results which hold for the minimization of quadratic problems with ellipsoidal constraints. The approach is tested on several problems randomly generated and on graph instances from the DIMACS challenge, medium size instances of the Maximum Clique Problem. The numerical results seem to suggest some effectiveness of the proposed approach.
Agent-Oriented software engineering report on the 4th AOSE workshop (AOSE 2003)
Authors: Paolo Giorgini
Venue: ACM SIGMOD Record (2003)

Agent-Orientation is emerging as a powerful new paradigm in computing. Concepts, methodologies and tools from the agents paradigm are one of the best candidates for the foundations of the next generation of mainstream software systems. The Agent-Oriented Software Engineering (AOSE) workshop is an international event that brings together researchers and groups active in the area of agent-based software development. Here we briefly report on the fourth edition of the AOSE workshop.
Foreword
Authors: William P. Birmingham, Clive L. Dym
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The collection of papers that follow this Editorial (beginning on page 43) come from the symposium &ldquo;Computing Futures in Engineering Design&rdquo; that was held on the campus of Harvey Mudd College in Claremont, California, on May 2&ndash;3, 1997. The symposium focused on future roles of computing in doing design and engineering and in the teaching of design and engineering. The intention of the symposium organizer, Clive Dym, was to provide useful insight, advice, and information to educators about how they might think about the future of design in engineering education.
Resource Management for Ad-Hoc Wireless Networks with Cluster Organization
Authors: Ionut Cardei, Srivatsan Varadarajan, Allalaghatta Pavan, Lee Graba, Mihaela Cardei, Manki Min
Venue: Cluster Computing (2004)

Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. Guaranteeing QoS in this environment is a hard problem because several applications may share the same resources in the network, and mobile ad-hoc wireless networks (MANETs) typically exhibit high variability in network topology and communication quality. In this paper we introduce DYNAMIQUE, a resource management infrastructure for MANETs. We present a resource model for multi-application admission control that optimizes the application admission utility, defined as a combination of the QoS satisfaction ratio. A method based on external adaptation (shrinking QoS for existing applications and later QoS expansion) is introduced as a way to reduce computation complexity by reducing the search space. We designed an application admission protocol that uses a greedy heuristic to improve application utility. For this, the admission control considers network topology information from the routing layer. Specifically, the admission protocol takes benefit from a cluster network organization, as defined by ad-hoc routing protocols such as CBRP and LANMAR. Information on cluster membership and cluster head elections allows the admission protocol to minimize control signaling and to improve application quality by localizing task mapping.
Concurrent Sizing, Vdd and Vth Assignment for Low-Power Design
Authors: Ashish Srivastava, Dennis Sylvester, David Blaauw
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We present a sensitivity based algorithm for total power including dynamic and subthreshold leakage power minimization using simultaneous sizing, Vdd and Vth assignment. The proposed algorithm is implemented and tested on a set of combinational benchmark circuits. Acomparison with traditional CVS based algorithms demonstrates the advantage of the algorithm including an average power reduction of 37% at primary input activities of 0.1. We also investigate the impact of various low Vdd values on total power savings.
The security of all RSA and discrete log bits
Authors: Johan Håstad, Mats Nåslund
Venue: Journal of the ACM (JACM) (2004)

We study the security of individual bits in an RSA encrypted message EN(x). We show that given EN(x), predicting any single bit in x with only a nonnegligible advantage over the trivial guessing strategy, is (through a polynomial-time reduction) as hard as breaking RSA. Moreover, we prove that blocks of O(log log N) bits of x are computationally indistinguishable from random bits. The results carry over to the Rabin encryption scheme.Considering the discrete exponentiation function gx modulo p, with probability 1 &minus; o(1) over random choices of the prime p, the analog results are demonstrated. The results do not rely on group representation, and therefore applies to general cyclic groups as well. Finally, we prove that the bits of ax + b modulo p give hard core predicates for any one-way function f.All our results follow from a general result on the chosen multiplier hidden number problem: given an integer N, and access to an algorithm Px that on input a random a &in; ZN, returns a guess of the ith bit of ax mod N, recover x. We show that for any i, if Px has at least a nonnegligible advantage in predicting the ith bit, we either recover x, or, obtain a nontrivial factor of N in polynomial time. The result also extends to prove the results about simultaneous security of blocks of O(log log N) bits.
Saying What it Means: Semi-Automated (News) Media Annotation
Authors: Frank Nack, Wolfgang Putz
Venue: Multimedia Tools and Applications (2004)

This paper considers the automated and semi-automated annotation of audiovisual media in a new type of production framework, A4SM (Authoring System for Syntactic, Semantic and Semiotic Modelling). We present the architecture of the framework, describe a prototypical camera, a handheld device for basic semantic annotation, and an editing suite to demonstrate how video material can be annotated in real time and how this information can not only be used for retrieval but also can be used during the different phases of the production process itself. We then outline the underlying XML Schema based content description structures of A4SM and discuss the pros and cons of our approach of evolving semantic networks as the basis for audio-visual content description.
Integrating applications with cache and memory management on a shared-memory multiprocessor
Authors: Harjinder S. Sandhu
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

In shared memory multiprocessors with NonUniform Memory Access (NUMA) characteristics, effective cacheing and memory locality are essential to performance. In this paper, we argue for a new approach for cache and NUMA memory management based upon the integration of application-sharing characteristics with system runtime management of shared data. An application's shared data is subdivided into shared regions of memory, and the application defines explicitly the operations on those regions. System runtime management can then achieve high cache hit rates and memory locality based upon these region specifications.Region-oriented cache management has the advantage over other software cache coherence techniques in that shared regions are always cacheable. Region-oriented main memory management improves upon traditional NUMA memory management by maintaining coherence at region granularity. This eliminates page-level false sharing as a concern for coherence and allows for more effective replication strategies. The specification of regions also permits the use of relaxed memory coherence protocols, which further improve performance.
The Many Faces of Mapping and Translation for Semantic Web Services
Authors: Mark H. Burstein
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Semantic web services hold the promise of greatly increasing interoperability among software agents and web services by enabling content-based (as opposed to format-based) automated service discovery and interaction. However, as different services may well use different, only partly compatible ontologies to describe their capabilities, some amount of ontology mapping ortranslation will be required during the various stages of service discovery and utilization. In this paper, we reexamine some of the processing assumptions that were made in the development of semantic web service models like DAML-S in order to uncover the very different roles of semantic translation in the subprocesses of service discovery, service process model interpretation, task negotiation, service invocation and response interpretation. We presentexamples and arguments showing how several different styles of translation will be required based on the informational context and perspectives of agents in each of these stages.
The Inherent Inefficiency of the Point-to-Point Congestion Revenue Right Auction
Authors: Shi-Jie Deng, Shmuel Oren, Sakis Meliopoulos
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Empirical evidence shows that the clearing prices for point-to-point congestion revenue rights, also known as financial transmission rights (FTRs), resulting from centralized auctions conducted by Independent System Operators differ significantly and systematically from the realized congestion revenues that determine the accrued payoffs of these rights. The question addressed by this paper is whether such deviations are due to price discovery errors which will eventually vanish or due to inherent inefficiencies in the auction structure. We address this question by studying a hypothetical DC-flow approximation model of a six-node system withknown outage probabilities of each element and known statistical demand variability.We show that even with perfect foresight of average congestion rents the clearing prices for the FTRs depend on the bid quantity and therefore may not be priced correctly in thefinancial transmission right (FTR) auction. In particular, we demonstrate that if all FTR bid quantities are equal to the corresponding average transaction volumes and the bid values are set at the expected congestion rent level, then the resulting auction prices systematically deviate from the known FTR values. We conclude that price discovery alone would not remedy the discrepancy between the auction prices and the realized values of the FTRs. Secondary markets or frequent recon.guration auctions are necessary in order to achieve such convergence.
Index-doubling in sequences by Aitken extrapolation
Authors: Roger Alexander
Venue: Mathematics of Computation (2003)

Aitken extrapolation, applied to certain sequences, yields the even-numbered subsequence of the original. We prove that this is true for sequences generated by iterating a linear fractional transformation, and for some sequences of convergents of the regular continued fractions of certain quadratic irrational numbers.
Robust polynomial neural networks in quantative-structure activity relationship studies
Authors: Tetyana I. Aksyonova, Vladimir V. Volkovich, Igor V. Tetko
Venue: Systems Analysis Modelling Simulation (2003)

This article presents the Robust Polynomial Neural Networks, a self-organizing multilayered iterative GMDH-type algorithm that provides robust linear and nonlinear polynomial regression models. The accuracy of the algorithm is compared to traditional GMDH and the multiple linear regression analysis using artificial and real data sets in quantitative-structure activity relationship studies. The calculated data shows that the proposed method is able to select nonlinear models characterized by a high prediction ability, it is insensible to outliers and irrelevant variables and thus it provides a considerable interest in quantitative-structure activity relationship studies.
Configuration-Sensitive Process Scheduling for FPGA-Based Computing Platforms
Authors: G. Chen, M. Kandemir, U. Sezer
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Reconfigurable computing has become an important part of research in software systems and computer architecture. While prior research on reconfigurable computing have addressed architectural and compilation/programming aspects to some extent, there is still not much consensus on what kind of operating system (OS) support should be provided. In this paper, we focus on OS process scheduler, and demonstrate how it can be customized considering the needs of reconfigurable hardware. Our process scheduler is configuration sensitive, that is, it reuses the current FPGA configuration as much as possible. Our extensive experimental results show that the proposed scheduler is superior to classical scheduling algorithms such First-Come-First-Serve (FCFS) and Shortest Job First (SJF).
A New Technique for Leakage Reduction in CMOS Circuits using Self-Controlled Stacked Transistors
Authors: Narender Hanchate, N. Ranganathan
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In CMOS circuits, the reduction of the threshold voltagedue to voltage scaling leads to increase in sub thresholdleakage current and hence, static power dissipation. Wepropose a novel technique called LECTOR for designingCMOS gates which significantly cuts down the leakage currentwithout increasing the dynamic power dissipation. Inthe proposed technique, we introduce two leakage controltransistors (a p-type and a n-type) within the logic gatefor which the gate terminal of each leakage control transistor(LCT) is controlled by the source of the other. In thisarrangement, one of the LCT's is always "near its cut-offvoltage" for any input combination. This increases the resistanceof the path from Vddto ground leading to significantdecrease in leakage currents. The gate-level netlist ofthe given circuit is first converted into a static CMOS complexgate implementation and then LCTs are introduced toobtain a leakage controlled circuit. The significant featureof LECTOR is that it works effectively in both active andidle states of the circuit, resulting in better leakage reductioncompared to other techniques. Further, the proposedtechnique overcomes the limitations posed by other existingmethods for leakage reduction. Experimental results indicatean average leakage reduction of 79.4% for MCNC '91benchmark circuits.
Sensitivity Analysis of Software Reliability for Component-Based Software Applications
Authors: Jung-Hua Lo, Chin-Yu Huang, Sy-Yen Kuo, Michael R. Lyu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The parameters in these software reliability models areusually directly obtained from the field failure data. Due tothe dynamic properties of the system and the insufficiency ofthe failure data, the accurate values of the parameters arehard to determine. Therefore, the sensitivity analysis isoften used in this stage to deal with this problem. Sensitivityanalysis provides a way to analyzing the impact of thedifferent parameters. In order to assess the reliability of acomponent-based software, we propose a new approach toanalyzing the reliability of the system, based on thereliabilities of the individual components and thearchitecture of the system. Furthermore, we present thesensitivity analysis on the reliability of a component-basedsoftware in order to determine which of the componentsaffects the reliability of the system most. Finally, threegeneral examples are evaluated to validate and show theeffectiveness of the proposed approach.
Why do we ReachOut?: functions of a semi-persistent peer support tool
Authors: Michal Jacovi, Vladimir Soroka, Sigalit Ur
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Collaboration plays a vital role in today's new business environment. Knowledge that resides within people's heads has become an invaluable resource. Many formal tools, such as e-mail or teamrooms, have been introduced to support formal collaboration and have been studied extensively. However, support for informal communication is still in its infancy. Much work has been done to analyze the functions that informal communication plays in the workplace. Recently, several studies have evaluated the roles that instant messaging (IM) plays in similar settings. Research shows that in the workplace, IM is used primarily for work-related purposes and accelerates the completion of important business tasks. Clearly, new tools that combine both formal and informal interaction can bring organizations tremendous rewards. ReachOut is a tool for semi-persistent collaboration and peer support developed by the Collaboration Technologies Group at the IBM Haifa Research Lab. This paper studies the role ReachOut plays in the workplace. We analyzed the collaboration activity of the community of IBM Haifa Labs employees who used ReachOut for a period of two months. As a result, we summarize the important functions played by tools that bridge between formal and informal communication in a workplace-based community.