ppxscal/embedding_network huggingface dataset:
Software Engineering Methods for Neural Networks
Authors: Anthony Senyard, Ed Kazmierczak, Leon Sterling
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Neural networks have been used to solve a wide range ofproblems. Unfortunately, many of the applications of neuralnetworks reported in the literature have been built in anad-hoc manner, without being informed by the techniquesand tools of software engineering. The problem with developingneural networks in an ad-hoc manner, using a "trialand error" or "build and fix" approach, is that successesare difficult to repeat. Building neural networks to solvespecific problems using ad-hoc processes is repeatable onlyif there is a sufficient culture of disciplined practice and experiencedpeople in the organisation to facilitate the process.In this paper we propose a set of methods for developingneural networks that can be used to systematicallyand repeatably "engineer" neural networks to solve specificproblems. We explore the "design problem" for neuralnetworks, and the problem of validating and verifying theoperation and learning algorithms for neural network software.A feature of our approach is to separate the genericcomponents of a neural network from the application specificcomponents.
Efficient Memory Integrity Verification and Encryption for Secure Processors
Authors: G. Edward Suh, Dwaine Clarke, Blaise Gassend, Marten van Dijk, Srinivas Devadas
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Secure processors enable new sets of applications suchas commercial grid computing, software copy-protection,and secure mobile agents by providing security from bothphysical and software attacks. This paper proposes newhardware mechanisms for memory integrity verification andencryption, which are two key primitives required in single-chipsecure processors. The integrity verification mechanismoffers significant performance advantages over existingones when the checks are infrequent as in grid computingapplications. The encryption mechanism improves theperformance in all cases.
Atomizer: a dynamic atomicity checker for multithreaded programs
Authors: Cormac Flanagan, Stephen N Freund
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on detecting race conditions, but the absence of race conditions does not by itself prevent undesired thread interactions. We focus on the more fundamental non-interference property of atomicity; a method is atomic if its execution is not affected by and does not interfere with concurrently-executing threads. Atomic methods can be understood according to their sequential semantics, which significantly simplifies (formal and informal) correctness arguments.This paper presents a dynamic analysis for detecting atomicity violations. This analysis combines ideas from both Lipton's theory of reduction and earlier dynamic race detectors. Experience with a prototype checker for multithreaded Java code demonstrates that this approach is effective for detecting errors due to unintended interactions between threads. In particular, our atomicity checker detects errors that would be missed by standard race detectors, and it produces fewer false alarms on benign races that do not cause atomicity violations. Our experimental results also indicate that the majority of methods in our benchmarks are atomic, supporting our hypothesis that atomicity is a standard methodology in multithreaded programming.
Linear approximation of arithmetic sum function
Authors: Krzysztof Chmiel
Venue: Artificial intelligence and security in computing systems (2003)

In the paper the results concerning the linear approximation of n-bit arithmetic sum function are presented. In particular, the computationally effective algorithms are formulated, to compute values of the approximation tables and the distribution of values in these tables as well as the algorithm to generate the list of effective approximations, ordered decreasingly by the approximation effectiveness measure.
Extracting an Explicitly Data-Parallel Representation of Image-Processing Programs
Authors: Lewis Baumstark, Murat Guler, Linda Wills
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Our research goal is to retarget image processingprograms written in sequential languages (e.g., C) toarchitectures with data-parallel processing capabilities.Image processing algorithms are often inherently data-parallel,but the artifacts imposed by the sequentialprogramming language (e.g., loops, pointer variables,linear address spaces) can obscure the parallelism andprohibit generation of efficient parallel code. This paperproposes a program representation and pattern-recognitionapproach for generating a data-parallelprogram specification from sequential source code. Therepresentation is based on an extension of the multi-dimensionalsynchronous dataflow (MDSDF) model ofcomputation.Central to extracting this representation from code isunderstanding the mapping between iterations and arrayvariables in the source code and the operations overarray regions (e.g., rows, columns, tiled blocks) that theyimplement. Examples are presented to illustrate thismapping, and a set of patterns for recognizing theseregions are proposed. The correctness of the retargetedMDSDF specifications are validated and the potentialspeedup from parallel execution shown.
A case for while-until
Authors: Daniel P. Friedman, Stuart C. Shapiro
Venue: ACM SIGPLAN Notices (1974)

A new control structure construct, the <u>while-until</u>, is introduced as a syntactic combination of the <u>while</u> and the <u>until</u>. Examples are shown indicating that use of the <u>while-until</u> can lead to structured programs that are conceptually more manageable than those attainable without it. The <u>while-until</u> statement is then extended to a valuereturning expression which is shown to be more powerful than either the <u>while</u> or the <u>until</u>.
DATE Panel: Chips of the Future: Soft, Crunchy or Hard?
Authors: Pierre G. Paulin
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Today's electronic products are composed of an increasingly diverse set of IC's, ranging from dedicated ASIC's, domain-specific ASSP's, platform FPGA's, to general-purpose FPGA's. With increasing integration, a mix of different fabrics on a single SoC becomes possible, combining ASIC-style standard cells, embedded FPGA's, mask-programmable sea-of-gates, and programmable processors. The panelists will present their vision of the fabric which will dominate SoC's in 90nm technologies and beyond, based on industrial trends and case studies. They will also outline the key CAD tool challenges for the chosen fabric.
A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints
Authors: Detong Zhu
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper we propose a new interior affine scaling region algorithm with nonmonotonic interior point backtracking technique for nonlinear optimization subject to linear equality and inequality constraints. The trust region subproblem in the proposed algorithm is defined by minimizing a quadratic function subject only to an affine scaling ellipsoidal constraint in a null subspace of the extended equality constraints. Using both trust region strategy and line search technique, the affine scaling trust region subproblem at each iteration generates backtracking interior step to obtain a new accepted step. The global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion should bring about speeding up the convergence progress in some ill-conditioned cases.
Considerations in the usage of text to speech (TTS) in the creation of natural sounding voice enabled web systems
Authors: Bryan Duggan, Mark Deegan
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The voice enabled web is a combination of XML based markup languages, speech recognition, text to speech (TTS) and web technologies. Key to the success of voice enabled web applications is the "naturalness" of the interface. Users are much more likely to interact with a system they feel comfortable with and that responds in a human like way. This paper describes the deployment of TTS in commercial voice enabled web systems and considers whether the excessive usage of TTS can be detrimental to users perceptions of the system.
Mining Association Rules with Linguistic Terms
Authors: Jianjiang Lu, Baowen Xu, Dazhou Kang, Huowang Chen, Hongji Yang
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Some problems of mining association rules with linguistic terms are discussed. First, an incremental updating algorithm of association rules with linguistic terms is presented. The collection of frequent linguistic attribute sets and its negative border along with their support count are maintained, which makes scan the entire database once at most in the process ofupdating association rules. The experiment shows that the updating algorithm can not only update association rules effectively but also avoid the repeated cost. Secondly, the parallel algorithm for mining association rules with linguistic terms is presented. The Boolean parallel mining algorithm is improved to discover frequent linguistic attribute sets, and the association rules with at least confidence are generated on all processors. This parallel mining algorithm has fine scaleup, sizeup and speedup.
A Case Study in Networks-on-Chip Design for Embedded Video
Authors: Jiang Xu, Wayne Wolf, Joerg Henkel, Srimat Chakradhar, Tiehan Lv
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

In this paper we study bus-based and switch-based on-chip networks for an embedded video application, the Smart Camera SoC (system on chip). We analyze network performance and overall system performance in detail. We explore system performance using crossbars with different sizes, fixed size but different numbers of ports, and different numbers of shared memories. We find that network is a performance bottleneck in our design, and the system using an optimized NoC can outperform one using a bus by 132%. Our simulations are based upon recorded real communication traces, which give more accurate system performance. Our study finds that for the Smart Camera system, a 16-bit/port 3x3 crossbar with two sharedmemories shows 85.7% performance improvement over the bus-based model and also has less maximum network throughput than the bus-based model. This design example illustrates a methodology to quickly and accurately estimate the performance of NoC's at architecture level.
An infinite family of semisymmetric graphs constructed from affine geometries
Authors: Shaofei Du, Furong Wang, Lin Zhang
Venue: European Journal of Combinatorics (2003)

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. In this paper, using the affine geometries, we construct an infinite family X(p, n) of semisymmetric graphs of order 2pn and valency p, where p is a prime and p ≥ n ≥ 3. Moreover, the graph X(3, 3) is isomorphic to the Gray graph found in 1932.
Reading, Writing, and Code
Authors: Diomidis Spinellis
Venue: Queue (2003)

Forty years ago, when computer programming was an individual experience, the need for easily readable code wasn’t on any priority list. Today, however, programming usually is a team-based activity, and writing code that others can easily decipher has become a necessity. Creating and developing readable code is not as easy as it sounds.
Drug design, protein secondary structure prediction and functional genomics
Authors: Ross D. King
Venue: ACM SIGBIO Newsletter (1998)

Inductive Logic Programming (ILP), Model Based Reasoning, Evolutionary computing, Artificial neural networks, Multivariate statistics. Drug Design, Protein Secondary Structure Prediction, Functional Genomics, Spectral interpretation for process monitoring, titre improvement, and organism identification.
Controlling devices with relays
Authors: Jason Ellison
Venue: Linux Journal (2004)

Your software can break free of the box and control lights, bells and motors in the real world. 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
Resolution-based correctness proofs of synchronous circuits
Authors: Paolo Camurati, Tiziana Margaria, Paolo Prinetto
Venue: Proceedings of the conference on European design automation (1991)

First-Order theorem provers like OTTER satisfy the vital need for versatility and efficiency in formal verification of correctness. This paper deals with experiences in applying OTTER to synchronous circuits. Synchronous circuits are first modeled, then proved correct by means of demodulation- and hyperresolution-based methodologies. Experimental examples are discussed, results are reported and a first comparison is drawn with other proof styles.
A Management Platform for Commercial Web Services
Authors: J. R. Hill
Venue: BT Technology Journal (2004)

Web Services offer the promise of allowing BT, along with its customers, partners and suppliers, to be able to assemble distributed applications that span multiple systems and organisations. The commercial drivers for this are cost reduction, new revenue opportunities and a better service through the use of automated end-to-end business processes. To achieve these benefits, BT will require a fully managed internal Web Services infrastructure.At the same time, creating a managed platform for our customers' Web Services deployments provides us with a new business opportunity. Early experience suggests that 20% of the effort in creating a commercial Web Services application is expended in defining the commercial opportunity, the service interfaces and server implementations. The remaining 80% is spent on ensuring that the operational and deployment environment is adequate to support business-grade service levels. Managing that 80% of the problem for our customers is a business opportunity for BT.This paper describes the requirements for a management platform for Web Services and then goes on to describe some of the value added business services that this platform can support.
Discontinuous enrichment methods for computational fluid dynamics
Authors: Saulo Pomponet Oliveira
Venue:  (2003)

This dissertation develops and analyzes discontinuous enrichment methods (DEM) for the advection equation, the advection-diffusion equation and the Stokes problem. These methods fit into the class of hybrid finite elements, where continuity of the unknowns are enforced with Lagrange multipliers. The flexibility of employing globally discontinuous weighting functions allows us to choose fundamental solutions of the differential equation as shape functions (the enrichment functions), in analogy with the method of residual-free bubbles (RFB). The enrichment functions derived herein were crucial in capturing boundary-layers on advection-diffusion problems and stabilizing a low-order velocity-pressure pair for the Stokes problem. Numerical experiments contrast DEM with stabilized continuous and discontinuous Galerkin methods.
Proceedings of the 5th international conference on Multimodal interfaces
Venue: International Conference on Multimodal Interfaces (2003)

It is our great pleasure to welcome you to ICMI 2003, the Fifth International Conference on Multimodal Interfaces, held during 5-7 November 2003 in Vancouver, Canada, and sponsored by the Association for Computing Machinery (ACM) and ACM SIGCHI.This year's meeting is being collocated with the ACM UIST conference, which will be held immediately prior to ICMI in the same location. The first two papers of ICMI are to be presented in a joint session of the two conferences.We are grateful to the National Science Foundation, Microsoft Corporation, Nissan Motor Company, NEWMic, General Motors, Mitsubishi Electric Research Labs, the Oregon Health & Science University, and Natural Interaction Systems for their generous support.Over 130 submissions were reviewed in a double-blind process by an international program committee. From this pool 32 long papers and 13 short papers were selected for inclusion in the proceedings. Presentations at the conference were assigned to either oral or poster presentation at the conference based on the judgment of the program committee as to the most effective mode of communicating the work, and not based on a judgment of relative quality. Demonstrations were invited to be presented at the conference, and a two-page abstract describing the work optionally included in this proceedings.The conference features invited talks from prominent researchers involved in three key areas of multimodal interfaces: Sandra Marshall on evaluating interfaces with eye tracking, Charles Spence on designing for cross-modal attention, and Anil Jain on multibiometrics and user identification. Abstracts for their keynote addresses are included in these proceedings.
An automatic image inpaint tool
Authors: Timothy K. Shih, Liang-Chen Lu, Rong-Chi Chang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Automatic digital inpainting is a challenge but interesting research area. This demonstration presents a tool, which uses a color interpolation mechanism to restore damaged images. The mechanism checks the variation of pixel blocks and restores pixels using different strategies. We test more than 1000 images, including photos, paintings, and cartoon drawings. The proposed system is also available at: http://www.mine.tku.edu.tw/demos/inpaint.
On the Minimizing Trajectory of Convex Functions with Unbounded Level Sets
Authors: W. T. Obuchowska
Venue: Computational Optimization and Applications (2004)

We consider a convex function f(x) with unbounded level sets. Many algorithms, if applied to this class of functions, do not guarantee convergence to the global infimum. Our approach to this problem leads to a derivation of the equation of a parametrized curve x(t), such that an infimum of f(x) along this curve is equal to the global infimum of the function on /Bbb Rn.We also investigate properties of the vectors of recession, showing in particular how to determine a cone of recession of the convex function. This allows us to determine a vector of recession required to construct the minimizing trajectory.
Characteristics of W and Cu/W gate MOS diodes fabricated by a process utilizing LPCVD of W and CU lift-off
Authors: D. N. Kouvatsos, V. Ioannou-Sougleridis, S. Tsevas, F. Christoforou, D. Davazoglou, C. Boukouras
Venue: Microelectronic Engineering (2003)

MOS diodes having double layer Cu/W, W, or Al gates were fabricated using tungsten chemical vapor deposition, copper evaporation and lift-off and were characterized before and after thermal anneals. The breakdown field statistics were determined for all kinds of devices, while the high field conduction and charge trapping in the oxide were investigated. The W gate devices exhibited high performance and very low degradation even after annealing at 650 °C. In Cu/W gate diodes good barrier action of our LPCVD tungsten films against copper penetration after annealing at 510 °C was observed, while reduced breakdown integrity and degradation due to copper diffusion occurred after annealing at 650 °C.
Note on "Guarantees in Auctions: The Auction House as Negotiator and Managerial Decision Maker"
Authors: Eric A. Greenleaf, Jun Ma, Wanhua Qiu, Ambar G. Rao, Atanu R. Sinha
Venue: Management Science (2002)

In this note, we identify two errors in Greenleaf, Rao, and Sinha's (1993) analysis of negotiation of guarantees in auctions. This note provides a high-level but self-contained summary of the revised results. We find that, in contrast with the earlier claim, guaranteed auctions lead to greater total expected revenue than conventional auctions. The ability to bargain over guarantee values and commissions certainly benefits sellers but may hurt the profits of auction houses. We relate these results to recent events in auction markets.
Electrical transconduction through organic layers Si-C bonded to silicon substrates
Authors: A. Scandurra, G. Indelli, G. Compagnini, S. Pignataro
Venue: Microelectronic Engineering (2003)

Organic self-assembled monolayers of 1-octadecene were attached to the silicon surface through strong Si-C bonds. The electron flow through this system was measured by using scanning tunneling microscopy-scanning tunneling spectroscopy. The data treatment suggest that this electron flow is a tunneling process.
Fault Tolerance in Collaborative Sensor Networks for Target Detection
Authors: Thomas Clouqueur, Kewal K. Saluja, Parameswaran Ramanathan
Venue: IEEE Transactions on Computers (2004)

Abstract--Collaboration in sensor networks must be fault-tolerant due to the harsh environmental conditions in which such networks can be deployed. This paper focuses on finding algorithms for collaborative target detection that are efficient in terms of communication cost, precision, accuracy, and number of faulty sensors tolerable in the network. Two algorithms, namely, value fusion and decision fusion, are identified first. When comparing their performance and communication overhead, decision fusion is found to become superior to value fusion as the ratio of faulty sensors to fault free sensors increases. As robust data fusion requires agreement among nodes in the network, an analysis of fully distributed and hierarchical agreement is also presented. The impact of hierarchical agreement on communication cost and system failure probability is evaluated and a method for determining the number of tolerable faults is identified.
Utilizing Solar Power in Wireless Sensor Networks
Authors: Thiemo Voigt, Hartmut Ritter, Jochen Schiller
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Sensor networks are designed especially for deploymentin adverse and non-accessible areas without a fixed infrastructure.Therefore, energy conservation plays a crucialrole for these networks. We propose to utilize solar powerin wireless sensor networks, establishing a topology where- changing over time - some nodes can receive and transmitpackets without consuming the limited battery resources.We propose and evaluate two protocols that perform solar-awarerouting. The presented simulation results show thatboth protocols provide significant energy savings when utilizingsolar power. The paper shows that incorporating thesolar status of nodes in the routing decision is feasible andresults in reduced overall battery consumption.
Maximal Spacing Configurations in Graphs
Authors: Peter Firby, Julie Haviland
Venue: Combinatorics, Probability and Computing (1997)

Let G=(V, E) be a simple connected graph of order &#x2223;V&#x2223;=n&ge;2 and minimum degree &delta;, and let 2&le;s&le;n. We define two parameters, the s-average distance &mu;s(G) and the s-average nearest neighbour distance &Lambda;s(G), with respect to each of which V contains an extremal subset X of order s with vertices &lsquo;as spread out as possible&rsquo; in G. We compute the exact values of both parameters when G is the cycle Cn, and show how to obtain the corresponding optimal arrangements of X. Sharp upper and lower bounds are then established for &Lambda;s(G), as functions of s, n and &delta;, and the extremal graphs described.