ppxscal/embedding_network huggingface dataset:
Generalized Analytical Model for the Design of Irregularly Shaped Power Planes and Passives in Mixed Signal Applications
Authors: Jeffrey McFiggins, Marie Yvanoff, Jayanti Venkataraman
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This work presents a generalized analytical method to obtain the S and Z matrices for irregular shaped planar resonant structures commonly found in mixed signal circuits. The method is based on a segmentation technique that uses an interconnect matrix in conjunction with a cavity model where resonant modes are predicted accurately through closed form expressions. The analytical formulation is very versatile and can be applied to both digital and RF circuitry. Typical structures such as the L-shaped power plane, rectangular ring power plane and rectangular coil inductor are considered where the S and Z matrices have been compared with published literature and full wave solvers. In all cases, there is excellent agreement. A design methodology has been developed to shape the power planes so that no resonances occur within the frequency range of interest. In the case of inductors, a similar design methodology can be developed where a physical layout is obtained for a required inductance value.
Covering a Finite Abelian Group by Subset Sums
Authors: W. Gao, O. Hamidoune, A. Llad&#x00f3;, O. Serra
Venue: Combinatorica (2003)

Let G be an abelian group of order n. The critical number c(G) of G is the smallest s such that the subset sums set &#x03a3;(S) covers all G for eachs ubset S&#x2282;G\{0} of cardinality |S|&#x2265;s. It has been recently proved that, if p is the smallest prime dividing n and n/p is composite, then c(G)=|G|/p+p&#x2212;2, thus establishing a conjecture of Diderrich.We characterize the critical sets with |S|=|G|/p+p&#x2212;3 and &#x03a3;(S)=G, where p&#x2265;3 is the smallest prime dividing n, n/p is composite and n&#x2265;7p2+3p.We also extend a result of Diderrichan d Mann by proving that, for n&#x2265;67, |S|&#x2265;n/3+2 and S=G imply &#x03a3;(S)=G. Sets of cardinality $${\left| S \right|} \geqslant \frac{{n + 11}} {4}$$ for which &#x03a3;(S) =G are also characterized when n&#x2265;183, the smallest prime p dividing n is odd and n/p is composite. Finally we obtain a necessary and sufficient condition for the equality &#x03a3;(G)=G to hold when |S|&#x2265;n/(p+2)+p, where p&#x2265;5, n/p is composite and n&#x2265;15p2.
The simplest examples where the simplex method cycles and conditions where expand fails to prevent cycling
Authors: J. A. J. Hall, K. I. M. McKinnon
Venue: Mathematical Programming: Series A and B (2004)

This paper introduces a class of linear programming examples that cause the simplex method to cycle and that are the simplest possible examples showing this behaviour. The structure of examples from this class repeats after two iterations. Cycling is shown to occur for both the most negative reduced cost and steepest-edge column selection criteria. In addition it is shown that the expand anti-cycling procedure of Gill et al. is not guaranteed to prevent cycling.
A Self-Restored Current-Mode CMOS Multiple-Valued Logic Design Technique and its Applications
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper presents a multiple-valued logic design technique using self-restored current-modeCMOS (CMCL). The design technique is discussed with two practical circuit examples including a majority circuit and a tally circuit. The resulting circuits are also compared with their binary equivalents in terms of area.
Market research for requirements analysis using linguistic tools
Authors: Mich Luisa, Franch Mariangela, Inverardi Pierluigi
Venue: Requirements Engineering (2004)

Numerous studies in recent months have proposed the use of linguistic instruments to support requirements analysis. There are two main reasons for this: (i) the progress made in natural language processing and (ii) the need to provide the developers of software systems with support in the early phases of requirements definition and conceptual modelling. This paper presents the results of an online market research intended (a) to assess the economic advantages of developing a CASE (computer-aided software engineering) tool that integrates linguistic analysis techniques for documents written in natural language, and (b) to verify the existence of the potential demand for such a tool. The research included a study of the language &#x2013; ranging from completely natural to highly restricted &#x2013; used in documents available for requirements analysis, an important factor given that on a technological level there is a trade-off between the language used and the performance of the linguistic instruments. To determine the potential demand for such tool, some of the survey questions dealt with the adoption of development methodologies and consequently with models and support tools; other questions referred to activities deemed critical by the companies involved. Through statistical correspondence analysis of the responses, we were able to outline two &#x201c;profiles&#x201d; of companies that correspond to two potential market niches, which are characterised by their very different approach to software development.
Application of Kernel-Based Feature Space Transformations and Learning Methods to Phoneme Classification
Authors: András Kocsor, László Tóth
Venue: Applied Intelligence (2004)

This paper examines the applicability of some learning techniques to the classification of phonemes. The methods tested were artificial neural nets (ANN), support vector machines (SVM) and Gaussian mixture modeling (GMM). We compare these methods with a traditional hidden Markov phoneme model (HMM), working with the linear prediction-based cepstral coefficient features (LPCC). We also tried to combine the learners with linear/nonlinear and unsupervised/supervised feature space transformation methods such as principal component analysis (PCA), independent component analysis (ICA), linear discriminant analysis (LDA), springy discriminant analysis (SDA) and their nonlinear kernel-based counterparts. We found that the discriminative learners can attain the efficiency of HMM, and that after the transformations they can retain the same performance in spite of the severe dimension reduction. The kernel-based transformations brought only marginal improvements compared to their linear counterparts.
Scheduling against an adversarial network
Authors: Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Using idle times of the processors is a well-known approach to run coarse grained parallel algorithms for extremely complex problems. We present on-line algorithms for scheduling the processes of a parallel application that is known off-line on a dynamic network in which the idle times of the processors are dictated by an adversary. We also take communication and synchronization costs into account.Our first contribution consists of a formal model to restrict the adversary in a reasonable way. We then show a constant factor approximation for the off-line scheduling problem. As this problem has to take communication cost into account, it can be seen as a generalization of many NP-hard parallel machine scheduling problems. Finally, we present on-line algorithms for different models with constant or with "nearly constant" competitive ratio.
Equivalent Waveform Propagation for Static Timing Analysis
Authors: Masanori Hashimoto, Yuji Yamada, Hidetoshi Onodera
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper proposes a scheme that captures diverse input waveformsof CMOS gates for static timing analysis. Conventionallythe latest arrival time and transition time are calculated from thetimings when a transient waveform goes across pre-determinedreference voltages. However, this method cannot accurately considerthe impact of waveform shape on gate delay, when crosstalk-inducednon-monotonic waveforms or inductance-dominant stepwisewaveforms are injected. We propose a new timing analysisscheme called "equivalent waveform propagation". The proposedscheme calculates the equivalent waveform that makes the outputwaveform close to the actual waveform, and uses the equivalentwaveform for timing calculation. The proposed scheme can copewith various waveforms affected by resistive shielding, crosstalknoise, wire inductance etc. In this paper, we devise a method tocalculate equivalent waveform. The proposed calculation methodis compatible with conventional methods in gate delay library andcharacterization, and hence our method is easy to be implementedwith conventional static timing analysis tools.
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
Authors: Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Venue: Machine Learning (2004)

One of the central problems in information retrieval, data mining, computational biology, statistical analysis, computer vision, geographic analysis, pattern recognition, distributed protocols is the question of classification of data according to some clustering rule. Often the data is noisy and even approximate classification is of extreme importance. The difficulty of such classification stems from the fact that usually the data has many incomparable attributes, and often results in the question of clustering problems in high dimensional spaces. Since they require measuring distance between every pair of data points, standard algorithms for computing the exact clustering solutions use quadratic or &ldquo;nearly quadratic&rdquo; running time&semi; i.e., O(dn2&minus;&alpha;(d)) time where n is the number of data points, d is the dimension of the space and &alpha;(d) approaches 0 as d grows. In this paper, we show (for three fairly natural clustering rules) that computing an approximate solution can be done much more efficiently. More specifically, for agglomerative clustering (used, for example, in the Alta Vista&trade; search engine), for the clustering defined by sparse partitions, and for a clustering based on minimum spanning trees we derive randomized (1 + &epsi;) approximation algorithms with running times &Otilde;(d2 n2&minus;&gamma;) where &gamma; > 0 depends only on the approximation parameter &epsi; and is independent of the dimension d.
An artificial intelligence technique to generate self-optimizing experimental designs
Authors: Nicholas V. Findler, Robert F. Cromp
Venue: ACM SIGACT News (1983)

The paper describes a completed and independent module of a large-scale system, the Quasi-Optimizer (<u>QO</u>). The <u>QO</u> system has three major objectives: (i) to observe and measure adversaries' behavior in a competitive environment, to infer their strategies and to construct a computer model, a <u>descriptive theory</u>, of each; (ii) to identify strategy components, evaluate their effectiveness and to select the most satisfactory ones from a set of computed descriptive theories; (iv) to combine these components in a quasi-optimum strategy that represents a <u>normative theory</u> in the statistical sense.The measurements on the input strategies can take place either in a sequence of confrontations unperturbed by the <u>QO</u>, or, for efficiency's sake, in a series of environments specified according to some experimental design. The module completed first, <u>QO-I</u>, can perform the experiments either in an exhaustive manner---when every level of a decision variable is combined with every level of the other decision variables---or, in relying on the assumption of a monotonically changing response surface, it uses the binary chopping technique.The module discussed here, <u>QO-3</u>, does not assume monotonic response surfaces and can deal also with multidimensional responses. It starts with a (loosely) balanced incomplete block design for the experiments and computes dynamically the specifications for each subsequent experiment. Accordingly, the levels of the decision variables in any single experiment and the length of the whole sequence of experiments depend on the responses obtained in previous experiments. In general, <u>QO-3</u> is an on-line, dynamic generator of experimental design that minimizes the total number of experiments performed for a predetermined level of precision.
Discriminatory mining of gene expression microarray data
Authors: Zuyi Wang, Yue Wang, Jianping Lu, Sun-Yuan Kung, Junying Zhang, Richard Lee, Jianhua Xuan, Javed Khan, Robert Clarke
Venue: Journal of VLSI Signal Processing Systems (2003)

Recent advances in machine learning and pattern recognition methods provide new analytical tools to explore high dimensional gene expression microarray data. Our data mining software, VISual Data Analyzer for cluster discovery (VISDA), reveals many distinguishing patterns among gene expression profiles, which are responsible for the cell's phenotypes. The model-supported exploration of high-dimensional data space is achieved through two complementary schemes: dimensionality reduction by discriminatory data projection and cluster decomposition by soft data clustering. Reducing dimensionality generates the visualization of the complete data set at the top level. This data set is then partitioned into subclusters that can consequently be visualized at lower levels and if necessary partitioned again. In this paper, three different algorithms are evaluated in their abilities to reduce dimensionality and to visualize data sets: Principal Component Analysis (PCA), Discriminatory Component Analysis (DCA), and Projection Pursuit Method (PPM). The partitioning into subclusters uses the Expectation-Maximization (EM) algorithm and the hierarchical normal mixture model that is selected by the user and verified "optimally" by the Minimum Description Length (MDL) criterion. These approaches produce different visualizations that are compared against known phenotypes from the microarray experiments. Overall, these algorithms and user-selected models explore the high dimensional data where standard analyses may not be sufficient.
Distributed and Dynamic Voronoi Overlays for Coverage Detection and Distributed Hash Tables in Ad-Hoc Networks
Authors: Bogdan Carbunar, Ananth Grama, Jan Vitek
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper we study two important problems - coverage-boundarydetection and implementing distributed has tables inad-hoc wireless networks.These problems frequently arise in servicelocation and relocation in wireless networks.For the centralizedcoverage-boundary problem we prove a ¿(n log n) lowerbound for n devices.We show that both problems can be effectivelyreduced to the problem of computing Voronoi overlays, andmaintaining these overlays dynamically.Since the computation ofVoronoi diagrams requires O(n log n) time, our solution is optimalfor the computation of the coverage-boundary.We present efficientdistributed algorithms for computing and dynamically maintainingVoronoi overlays, and prove the stability properties for thelatter - i.e., if the nodes stop moving, the overlay stabilizes to thecorrect Voronoi overlay.Finally, we present experimental resultsin the context of the two selected applications, which validate theperformance of our distributed and dynamic algorithms.
From coherent to incoherent dynamical behaviour of quantum atomic gases in periodic potentials
Authors: M. M. Cerimele, M. L. Chiofalo, F. Pistella
Venue: Applied Numerical Mathematics (2004)

In seminal experiments performed in 1995, alkali atomic gases have been cooled to nanokelvin temperatures to form a new state of matter which shows macroscopic quantum coherence and Bose-Einstein condensation. We give a physics-oriented view of diverse transport behaviours of these Bose-Einstein condensates, which can be explored after solving a nonlinear Schrödinger equation by means of an explicit time-marching algorithm. Coherent and decoherent transport behaviour in periodic potentials is reviewed and new aspects related to chaotic nonlinear dynamics are anticipated.
Clock Period Minimization of Non-Zero Clock Skew Circuits
Authors: Shih-Hsu Huang, Yow-Tyng Nieh
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

It is known that the clock skew can be exploited as a manageableresource to improve the circuit performance. However, due to thelimitation of race condition, the optimal clock skew schedulingdoes not achieve the lower bound of the clock period. In thispaper, we propose a polynomial time complexity algorithm, whichincorporates optimal clock skew scheduling and delay insertion,for the synthesis of non-zero clock skew circuits. The mainadvantages of our algorithm include two parts. First, it guaranteesto achieve the lower bound of the clock period. Secondly, it alsotries to minimize the required inserted delays under the lowerbound of the clock period. Experimental data shows that, eventhough we only use the buffers in a standard cell library toimplement the delay insertion, our approach still works well.
Enabling Distribution and Reuse of Ontology Mapping Information for Semantically Enriched Communication Services
Authors: Eva Gahleitner, Wolfram Wos
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In the past, many attempts have been made to improve the interoperability between different Web-based information systems. In most approaches the remaining problems are still twofold. They are optimized for specific business sectors and they do not cope with the challenge of incorporating semantics into data. In the Semantic Web ontologies and ontology mapping are often seen as new solutions providing semantically enriched information exchange facilities. In this paper a communication framework for ontology mapping is introduced in order to support several applications accessing multiple ontologies. A common interface for distribution and reuse of ontology mapping information based on the concept of semantic bridges is part of the framework.
Static coarse grain task scheduling with cache optimization using OpenMP
Authors: Hirofumi Nakano, Kazuhisa Ishizaka, Motoki Obata, Keiji Kimura, Hironori Kasahara
Venue: International Journal of Parallel Programming (2003)

Effective use of cache memory is getting more important with increasing gap between the processor speed and memory access speed. Also, use of multigrain parallelism is getting more important to improve effective performance beyond the limitation of loop iteration level parallelism. Considering these factors, this paper proposes a coarse grain task static scheduling scheme considering cache optimization. The proposed scheme schedules coarse grain tasks to threads so that shared data among coarse grain tasks can be passed via cache after task and data decomposition considering cache size at compile time. It is implemented on OSCAR Fortran multigrain parallelizing compiler and evaluated on Sun Ultra80 four-processor SMP workstation using Swim and Tomcatv from the SPEC fp 95. As the results, the proposed scheme gives us 4.56 times speedup for Swim and 2.37 times on 4 processors for Tomcatv respectively against the Sun Forte HPC Ver. 6 update 1 loop parallelizing compiler.
Measuring the impact of organizational constraints on the success of business-to-business e-commerce efforts: a transactional focus
Authors: Frederick Kaefer, Elliot Bendoly
Venue: Information and Management (2004)

This study investigated the impact of two organizational constraints, technological compatibility and operational capacity, on the success of business-to-business (B2B) electronic commerce (e-commerce) efforts over a range of business settings. We focused specifically on the transactional efficiencies gained through the use of B2B e-commerce. To accomplish this, we considered an instrument originally developed to measure the benefits of intra-organizational information systems and applied it in two inter-organizational contexts: electronic data interchange (EDI) usage, and B2B technology usage by firms without EDI. Analysis was carried out on 86 firms in the consumer electronics industry, approximately half of which were product-manufacturing firms and the other half service-providing firms. Our findings showed that the inter-organizational context had a significant bearing on which constraints have a greater impact on the success of B2B e-commerce efforts.
Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
Authors: E. Kokiopoulou, C. Bekas, E. Gallopoulos
Venue: Applied Numerical Mathematics (2004)

A matrix-free algorithm, IRLANB, for the efficient computation of the smallest singular triplets of large and possibly sparse matrices is described. Key characteristics of the approach are its use of Lanczos bidiagonalization, implicit restarting, and harmonic Ritz values. The algorithm also uses a deflation strategy that can be applied directly on Lanczos bidiagonalization. A refinement postprocessing phase is applied to the converged singular vectors. The computational costs of the above techniques are kept small as they make direct use of the bidiagonal form obtained in the course of the Lanczos factorization. Several numerical experiments with the method are presented that illustrate its effectiveness and indicate that it performs well compared to existing codes.
Integrating vertical and horizontal partitioning into automated physical database design
Authors: Sanjay Agrawal, Vivek Narasayya, Beverly Yang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a relational database system that significantly impact performance. Horizontal partitioning also provides manageability; database administrators often require indexes and their underlying tables partitioned identically so as to make common operations such as backup/restore easier. While partitioning is important, incorporating partitioning makes the problem of automating physical design much harder since: (a) The choices of partitioning can strongly interact with choices of indexes and materialized views. (b) A large new space of physical design alternatives must be considered. (c) Manageability requirements impose a new constraint on the problem. In this paper, we present novel techniques for designing a scalable solution to this integrated physical design problem that takes both performance and manageability into account. We have implemented our techniques and evaluated it on Microsoft SQL Server. Our experiments highlight: (a) the importance of taking an integrated approach to automated physical design and (b) the scalability of our techniques.
Advanced Pyramid Broadcasting for Video-on-Demand
Authors: Haibin Lu, Junqiang Lan, Xinhua Zhuang
Venue: Proceedings of the IEEE Sixth International Symposium on Multimedia Software Engineering (2004)

Broadcasting protocols are used to reduce the bandwidth requirement of distributing popular videos invideo-on-demand system. The scheme proposed in [1] claimed that it can reduce the client buffer requirement and the server network bandwidth of mirrored-pyramid broadcasting scheme [2] without increasing the client access latency. The idea in [1] itself is good and has the potential to achieve the claimed good performance. However, the mismatch between the video segmentation and broadcasting protocol leaves the results problematic. We present the remedy in this paper and analyze the performance of the revised broadcasting protocol. We compare the revised protocol with the enhanced mirrored-pyramid broadcasting protocol [3]; the results show that the revised protocol does improve the client buffer requirement without sacrificing the server bandwidth and client access latency.