ppxscal/embedding_network huggingface dataset:
Synthesis of custom processors based on extensible platforms
Authors: Fei Sun, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Efficiency and flexibility are critical, but often conflicting, design goals in embedded system design. The recent emergence of extensible processors promises a favorable tradeoff between efficiency and flexibility, while keeping design turnaround times short. Current extensible processor design flows automate several tedious tasks, but typically require designers to manually select the parts of the program that are to be implemented as custom instructions.In this work, we describe an automatic methodology to select custom instructions to augment an extensible processor, in order to maximize its efficiency for a given application program. We demonstrate that the number of custom instruction candidates grows rapidly with program size, leading to a large design space, and that the quality (speedup) of custom instructions varies significantly across this space, motivating the need for the proposed flow. Our methodology features cost functions to guide the custom instruction selection process, as well as static and dynamic pruning techniques to eliminate inferior parts of the design space from consideration. Further, we employ a two-stage process, wherein a limited number of promising instruction candidates are first selected, and then evaluated in more detail through cycle-accurate instruction set simulation and synthesis of the corresponding hardware, to identify the custom instruction combinations that result in the highest program speedup or maximize speedup under a given area constraint.We have evaluated the proposed techniques using a state-of-the-art extensible processor platform, in the context of a commercial design flow. Experiments with several benchmark programs indicate that custom processors synthesized using automatic custom instruction selection can result in large improvements in performance (upto 5.4X, average of 3.4X), energy (upto 4.5X, average of 3.2X), and energy-delay product (upto 24.2X, average of 12.6X), while speeding up the design process significantly.
Dynamic On-line Object Update in the Grumps System
Authors: Huw Evans
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This position paper describes the Grumps approach to the on-line upgrading of objects in a distributed system. This is supported by three main, well-known ideas: core code abstractions are defined in terms of Java interfaces and not classes; as many decisions as possible are delayed until run-time; and object containers are used to manage groups of objects at run-time. The advantage of the first idea is that it introduces a level of indirection in betweenwhat an object does (in terms of its interface) and how that is accomplished (in terms of its class). The advantage of the second idea is that it does not force the programmer to makedecisions at compile-time that may be hard to change later; they can change their mind and easily alter the system's behaviour at run-time. The use of the third idea allows objects to be grouped together and the container can act as a representative for or abstraction over the contained objects. The major Grumps abstractions are described, an example object upgrade is presented and the advantages and disadvantages of this approach are discussed.
A product formula for orthogonal polynomials associated with infinite distance-transitive graphs
Authors: Michael Voit
Venue: Journal of Approximation Theory (2003)

The infinite, locally finite distance-transitive graphs form an extension of homogeneous trees and are described by two discrete parameters. The associated orthogonal polynomials may be regarded as spherical functions of certain Gelfand pairs or as characters of some polynomial hypergroups; they are certain Bernstein polynomials and admit a discrete nonnegative product formula. In this paper we use the graph-theoretic origin of these polynomials to derive the existence of positive dual continuous product and transfer formulas. The dual product formulas will be computed explicitly.
Grid high performance networking in the DataGRID project
Authors: Pascale Vicat-Blanc-Primet
Venue: Future Generation Computer Systems (2003)

This paper presents an overview of the high performance Grid networking activities in the DataGRID project. We examine the main issues raised at network level by the design and the development of a large-scale Grid Testbed. We present the application requirement studies, the underlying network infrastructure and the initial network monitoring architecture that is under development in the context of the project.
Vexed puzzle solver: developing a program incrementally
Authors: Thomas Hruska
Venue: Journal of Computing Sciences in Colleges (2003)

The game of Vexed offers students an interesting programming exercise for at any level of education. It also offers instructors a project with incremental development opportunities and a context for introducing a wide range of topics throughout the undergraduate program. Instructors introduce students to techniques and optimizations in each class through the motivating search for performance.
MRF parameter estimation by an accelerated method
Authors: Yihua Yu, Qiansheng Cheng
Venue: Pattern Recognition Letters (2003)

Markov random field (MRF) modelling is a popular method for pattern recognition and computer vision and MRF parameter estimation is of particular importance to MRF modelling. In this paper, a new approach based on Metropolis-Hastings algorithm and gradient method is presented to estimate MRF parameters. With properly chosen proposal distribution for Metropolis-Hastings algorithm, the Markov chain constructed by the method converges to stationary distribution quickly and it gives a good estimation result.
Multimedia home networks: standards and interfaces
Authors: Th. Zahariadis, K. Pramataris
Venue: Computer Standards Interfaces (2002)

Nowadays, wireline/wireless, mature and cost-effective solutions for both the access and the in-home network exist. Interconnecting the diverse in-home with the broadband access networks offers an unprecedented opportunity to increase the networking customer base beyond the satiated corporate environment. However, the large variety of noninteroperable residential and access networks retard the large deployment. In this paper, we briefly present a Home Network Architecture and a number of alternative access and indoor network media protocols. Moreover, we describe selected, higher-layer proposals and standardisation efforts, which aim to solve the interoperability problem. These technologies are independent from the physical medium and the lower layers, and aim to provide convergence between multiple home and access networks. Moreover, we propose a solution based on the Residential Gateway (RG) device. The RG is a single point of access and indoor networks convergence, which carries out the switching functions for telecommnnication, computing and entertainment service deliveries to the end-users.
What's in a name? Ask yahoo!
Authors: Ubiquity staff
Venue: Ubiquity (2001)

A company's brand is one of its most valuable assets, one that few high tech companies -- most recently HP and Compaq -- understand how to leverage, according to Sam Hill. Hill is co-author (with Chris Lederer) of the new book, The Infinite Asset: Managing Brands to Build New Value. He is the former chief marketing officer at Booz Allen & Hamilton and currently a partner at Helios Consulting Group and also co-author of Radical Marketing, now in its fourth printing.
Wavelet domain signal deconvolution with singularity-preserving regularization
Authors: C. Sánchez-Ávila
Venue: Mathematics and Computers in Simulation (2003)

In this paper, we consider a wavelet based singularity-preserving regularization scheme for use in signal deconvolution problems. The inverse problem of finding solutions with singularities to discrete Fredholm integral equations of the first kind arises in many applied fields, e.g. in Geophysics. This equation is usually an ill-posed problem when it is considered in a Hilbert space framework, requiring regularization techniques to control arbitrary error amplifications and to get adequate solutions. Thus, considering the joint detection-estimation character this kind of signal deconvolution problems have, we introduce two novel algorithms which involve two principal steps at each iteration: (a) detecting the positions of the singularities by a nonlinear projection selection operator based on the estimation of Lipschitz regularity using the discrete dyadic wavelet transform; and (b) estimating the amplitudes of these singularities by obtaining a regularized solution of the original equation using the a priori knowledge and the above approximation. Some simulation examples serve to appreciate the high performance of the proposed techniques in this kind of problems.
The smallest solutions to the diophantine equation x6 + y6 = a6 + b6 + c6 + d6 + e6
Authors: Giovanni Resta
Venue: Mathematics of Computation (2003)

In this paper we discuss a method used to find the smallest non-trivial positive integer solutions to a16 + a26 = b16 + b26 + b36 + b46 + b56. The method, which is an improvement over a simple brute force approach, can be applied to search the solution to similar equations involving sixth, eighth and tenth powers.
Multiobjective fuzzy regression with central tendency and possibilistic properties
Authors: Liem Tran, Lucien Duckstein
Venue: Fuzzy Sets and Systems (2002)

A multiobjective fuzzy regression model (MOFR) is developed. This MOFR model combines central tendency and possibilistic properties of statistical and fuzzy regressions and overcomes several shortcomings of these two approaches. A new class of distance measure for two intervals that takes into account all the points in both intervals is introduced. The methodology is illustrated by numerical examples.
An optimal order multilevel preconditioner with respect to problem and discretization parameters
Authors: Owe Axelsson, Svetozar Margenov
Venue: Scientific computing and applications (2001)

Preconditioners based on various multilevel extensions of two-level finite element methods lead to iterative methods which have an optimal order computational complexity with respect to the size (or discretization parameter) of the system. The methods can be on block matrix factorized form, recursively extended via certain matrix polynomial approximations of the arising Schur complement matrices or on additive, i.e. block diagonal form using stabilizations of the condition number at certain levels. The resulting spectral equivalence holds uniformly with respect to jumps in the coefficients of the differential operator and for arbitrary triangulations. Such methods were first presented by Axelsson and Vassilevski in the late 80s.An important part of the algorithm is the treatment of the systems with the diagonal block matrix, which arise on each finer level and corresponds to the added degrees of freedom on that level. This block is well-conditioned for model type problems but becomes increasingly ill-conditioned when the coefficient matrix becomes more anisotropic or, equivalently, when the mesh aspect ratio increases.In the paper two methods are presented to approximate this matrix also leading to a preconditioner with spectral equivalence bounds which hold uniformly with respect to both the problem and discretization parameters. The same holds therefore also for the preconditioner to the global matrix.
Literate software development
Authors: Shereef Abu Al-Maati, Abdul Aziz Boujarwah
Venue: Journal of Computing Sciences in Colleges (2002)

This paper describes preliminary results of the challenges along with a proposed solution to a research project for developing a new methodology called LSD (Literate Software Development) accompanied with a tool, WebBox, for engineering software using a combination of box structures and literate programming. The union of two software engineering methodologies from two renowned computer scientists, Box Structures by the late Harlan Mills and Literate Programming by Donald Knuth has never before been accomplished or proposed, despite the fact that they are an ideal match; each one's strengths complement the other's shortcomings.
Feature-based classification of time-series data
Authors: Alex Nanopoulos, Rob Alcock, Yannis Manolopoulos
Venue: Information processing and technology (2001)

In this paper we propose the use of statistical features for time-series classification. The classification is performed with a multi-layer perceptron (MLP) neural network. The proposed method is examined in the context of Control Chart Pattern data, which are time series used in Statistical Process Control. Experimental results verify the efficiency of the feature-based classification method, compared to previous methods which classify time series based on the values of each time point. Moreover, the results show the robustness of the proposed method against noise and time-series length.
Tool capacity planning in semiconductor manufacturing
Authors: Bülent Çatay, Ş. Selçuk Erengüç, Asoo J. Vakharia
Venue: Computers and Operations Research (2003)

The demand for distinct wafer types in semiconductor manufacturing is an explicit function of the electronic components in which these wafers are used. Given that the component demands vary not only by the product type but also over time, it is obvious that wafer demands are also lumpy and time varying. In this paper, we discuss strategic level investment decisions on procuring new equipment and aggregate level capacity planning. In this context, we examine the problem of planning wafer production over multiple time periods within a single facility assuming that a demand forecast for each wafer type for each period is known. To address this problem, we develop a multi-period mixed-integer programming model to minimize the machine tool operating costs, new tool acquizition costs, and inventory holding costs. Given that production of wafers requires a large number of operations with multiple tools capable of performing each operation, tool operating costs are explicitly minimized by integrating the assignment of specific operations to tools in our model. Since our model is computationally intractable, we propose a Lagrangean-based relaxation heuristic to find efficient tool procurement plans.
A fuzzy logic controller for traffic junction signals
Authors: Chih-Hsun Chou, Jen-Chao Teng
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

In this paper a fuzzy logic based traffic junction signal controller (FTJSC) is presented. In order to design a more practical controller, we simulated an environment that meets the traffic situations more than ever. This environment is generalized by considering the number of consecutive junctions, the number of lanes, the lengths of vehicles, and the lengths of streets. Compared with existing studies, the proposed fuzzy controller has the following characteristics: different input variables, lower inference frequency, fewer control rules (9 rules), and correlating each junction with others. It is applicable to multiple junctions and multiple lanes without any modification. The experimental results with low, medium and high traffic loads confirm the performance of the proposed FTJSC.
Idea and Ar-Idea: Models for Dealing with Imprecise Data in Dea
Authors: William W. Cooper, Kyung Sam Park, Gang Yu
Venue: Management Science (1999)

Data Envelopment Analysis (DEA) is a nonparametric approach to evaluating the relative efficiency of decision making units (DMUs) that use multiple inputs to produce multiple outputs. An assumption underlying DEA is that all the data assume the form of specific numerical values. In some applications, however, the data may be imprecise. For instance, some of the data may be known only within specified bounds, while other data may be known only in terms of ordinal relations. DEA with imprecise data or, more compactly, the Imprecise Data Envelopment Analysis (IDEA) method developed in this paper permits mixtures of imprecisely- and exactly-known data, which the IDEA models transform into ordinary linear programming forms. This is carried even further in the present paper to comprehend the now extensively employed Assurance Region (AR) concepts in which bounds are placed on the variables rather than the data. We refer to this approach as AR-IDEA, because it replaces conditions on the variables with transformations of the data and thus also aligns the developments we describe in this paper with what are known as cone-ratio envelopments in DEA. As a result, one unified approach, referred to as the AR-IDEA model, is achieved which includes not only imprecise data capabilities but also assurance region and cone-ratio envelopment concepts.
Experiences with windows NT as a cluster computing platform for parallel computing
Authors: Markus Fischer, Jack Dongarra
Venue: Cluster Computing (2001)

The increasing number of clusters built by commercial, off the shelf hardware shows a new trend in scientific computing. Within this movement is the propagation towards Windows NT as an operating system on PCs, The UNIX environment and Windows NT differ in terms of administrative issues as well as programming techniques. In this paper, we describe the modification of PVM (Parallel Virtual Machine) to enable interoperation with WIN32 (Windows NT 4/5 and Windows 95/98). PVM provides the functionality to harness the computing power of an WIN32 cluster environment. Our migration from UNIX to the WIN32 architecture not only shows where porting existing software is easy and where more generic modules have to be designed, but also the limitations.
Fast joins using join indices
Authors: Zhe Li, Kenneth A. Ross
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1999)

Two new algorithms, &ldquo;Jive join&rdquo; and &ldquo;Slam join,&rdquo; are proposed for computing the join of two relations using a join index. The algorithms are duals: Jive join range-partitions input relation tuple ids and then processes each partition, while Slam join forms ordered runs of input relation tuple ids and then merges the results. Both algorithms make a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a temporary file, whose size is half that of the join index. Both algorithms require only that the number of blocks in main memory is of the order of the square root of the number of blocks in the smaller relation. By storing intermediate and final join results in a vertically partitioned fashion, our algorithms need to manipulate less data in memory at a given time than other algorithms. The algorithms are resistant to data skew and adaptive to memory fluctuations. Selection conditions can be incorporated into the algorithms. Using a detailed cost model, the algorithms are analyzed and compared with competing algorithms. For large input relations, our algorithms perform significantly better than Valduriez's algorithm, the TID join algorithm, and hash join algorithms. An experimental study is also conducted to validate the analytical results and to demonstrate the performance characteristics of each algorithm in practice.
Minimal Realization of Completely Decidable Linear Differential Equations
Authors: I. V. Gaishun, V. V. Goryachkin
Venue: Automation and Remote Control (2003)

For a linear system S in total differentials (Pfaff system), proposed was a procedure of constructing its minimal realization S0, that is, the Pfaff vector equation such that its phase space has the least dimensionality if the set of its output functions coincides with the family of the outputs of S.
Using Technology and Constituting Structures: A Practice Lens for Studying Technology in Organizations
Authors: Wanda J. Orlikowski
Venue: Organization Science (2000)

As both technologies and organizations undergo dramatic changes in form and function, organizational researchers are increasingly turning to concepts of innovation, emergence, and improvisation to help explain the new ways of organizing and using technology evident in practice. With a similar intent, I propose an extension to the structurational perspective on technology that develops a practice lens to examine how people, as they interact with a technology in their ongoing practices, enact structures which shape their emergent and situated use of that technology. Viewing the use of technology as a process of enactment enables a deeper understanding of the constitutive role of social practices in the ongoing use and change of technologies in the workplace. After developing this lens, I offer an example of its use in research, and then suggest some implications for the study of technology in organizations.
k-Subdomination in graphs
Authors: Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
Venue: Discrete Applied Mathematics (2002)

For a positive integer k, a k-subdominating function of a graph G=(V,E) is a function f:V → {-1,1} such that Σu∈NG[v]f(u) ≥ 1 for at least k vertices v of G. The k- subdomination number of G, denoted by γks(G), is the minimum of Σv ∈ V f(v) taken over all k-subdominating functions f of G. In this article, we prove a conjecture for k-subdomination on trees proposed by Cockayne and Mynhardt. We also give a lower bound for γks(G) in terms of the degree sequence of G. This generalizes some known results on the k-subdomination number γks(G), the signed domination number γs(G) and the majority domination number γmaj(G).
Marketable Pollution Permits in Oligopolistic Markets with Transaction Costs
Authors: Anna Nagurney, Kanwalroop Kathy Dhanda
Venue: Operations Research (2000)

In this paper, we present a variational inequality framework for the modeling, qualitative analysis, and computation of equilibrium patterns in multiproduct, multipollutant oligopolistic markets with marketable pollution permits in the presence of transaction costs. The model deals explicitly with spatial differentiation and also guarantees that the imposed environmental quality standards are met through the initial allocation of licenses. An algorithm is proposed, with convergence results, to compute the profit-maximized quantities of the oligopolistic firms' products and the quantities of emissions, along with the equilibrium allocation of licenses and their prices. Numerical examples are included to illustrate this approach.
Parallel and distributed computations for structural mechanics: a review
Authors: Z. Bittnar, J. Kruis, J. Němeček, B. Patzák, D. Rypl
Venue: Civil and structural engineering computing: 2001 (2001)

Typical engineering design offices are equipped with several PC computers with different processor power, available memory and disk capacity. The computers are usually connected with fast Ethernet. The computing performance is relatively high with respect to the demands of design process involving CAD, structural analysis, etc. This makes the offices well equipped for high performance computing provided relevant parallel software is available. Although there may be different combinations of hard-ware and software forming a parallel computing environment it can be shown that the results (computational time, speedup, efficiency) achieved on such cluster are competitive to results obtained on special parallel computers, as IBM SP2, SGI Origin, etc. It is important to realize that from engineering point of view the scalability of the algorithm is not the only criterion to judge the efficiency of parallel application. In many case, the ability to analyze extremely large problems not solvable on individual machines is of primary interest.