ppxscal/embedding_network huggingface dataset:
Parallel Incremental Compaction
Authors: G N Sullivan, B J Rosenberg
Venue:  (1988)

Electronic computer-aided design algorithms for the symbolic compaction of VLSI layouts are very problematic. They have produced unacceptably poor area results and are frequently prohibitively slow in doing so. Furthermore, expert designers are given no chance to intervene during the compaction process to provide guidance. A solution to all three of these problems is proposed, which is based on a new technique called parallel incremental compaction. Area results are improved by allowing user-defined constraints and by coarse-grained parallelism that permits exploring a great number of possible configurations rapidly. Compaction speed is increased by using fine-grained parallelism to process individual cells in a massively parallel sweeping compaction algorithm. Overall throughput is also dramatically improved through incremental compaction where the step-wise nature of the physical design process is matched by an incremental approach to compaction as opposed to batch processing vast numbers of cells.
DSP Applications Using C and the TMS320C6x DSK
Authors: Rulph Chassaing
Venue:  (2002)

:* The TMS320C6x is Texas Instrument's next generation DSP found in over 60 percent of wireless devices from leading manufacturers such as Ericsson, Nokia, Sony, and Handspring* Author has many years experience working with the TI line of TMS DSPs and his books are based on courses and seminars given at TI sponsored meetings* All programs listed in the text will be available on the Wiley FTP site* In addition to its wireless applications, the TMS DSP is tailored to enable a new generation of Internet media entertainment appliances
Dynamic File Organization and Heuristic Search Strategies in Information Retrieval
Authors: E. Ide, Gerard Salton
Venue:  (1969)

A great deal of effort has been devoted in recent years to the evaluation of automatic or semi-automatic information retrieval systems. Recent evaluation results indicate that the search effectiveness presently achieved, or likely to be achievable in the foreseeable future, is much smaller than expected by a majority of the potential user population. Furthermore, theoretical advances in language analysis and data organization promise only relatively modest future improvements. The most significant advances in retrieval effectiveness are likely to be obtained by using adaptive techniques to extract information from the user population during the search process, leading to an improved organization of the data space and to more effective search and retrieval operations. Various user feddback techniques are described producing either modifications in the user queries i such a way as to bring these queries closer to existing groups of relevant documents, or modifications in the document space to bring relevant documents closer to the corresponding search requests. The feedback and space modification techniques are examined in detail, and the resulting efficiencies in the remote and retrieval operations are described. Descriptive Terms: Information retrieval, document retrieval, user feedback, relevance feedback, request modifications, document modifications, document grouping, clustering, adaptive search method, cluster searches, search effectiveness.
A Very Flexible DSP-Based Controller for On-Line Test and Control of Industrial Processes
Authors: M. E. Nillesen, A. Del Pizzo, M. Pasquariello, R. Rizzo
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

The paper presents a very flexible Digital Signal Processor-based controller. The flexible structure of this controller permits not only an implementation of many kind of different control algorithms, but will permit also on-line tests of industrial processes. The flexibility is given by a modular structure, i.e. the controller can be adapted to the requirements of the control or test algorithm. First a description is given of the system and finally, a possible implementation of an automotive test system is presented. The application of optical fibres makes the tester less sensitive for ElectroMagnetic Interference. Furthermore, the on-line tests can be performed from a safe distance. Useful analog information from the various sensors are transferred with the help of shielded cables. Digital Signal Processors have a wide application field and are very suitable as standalone testers or controllers. They are ideal for visualising, since they offer the possibility to filter digitally the measurements. The flexible presented controller will especially be interesting for Research and Development projects, since its modularity and flexibility will permit a lot of freedom in implementing new control and test algorithms.
An Improved Representation of Functions for Partition Based Functional Decomposition
Authors: Muthukumar Venkatesan, Henry Selvaraj, Robert Bignall
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Functional decomposition is a process off a complex function as a functionof functions with fewer variables.Earlier partition based functional decomposition tools represent the functions using r-partition.The r-partition representations isan abstruct representation of the function and their memory requirements are super-exponential.
Coupling Noise Analysis for VLIS and ULSI Circuits
Authors: Kathirgamar Aingaran, Fabian Klass, Chin-Man Kim, Chaim Amir, Joydeep Mitra, Eileen You, Jamil Mohd, Sai-Keung Dong
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Although digital circuits are inherently immune to most sources of noise, the scaling of supply voltages and MOSFET threshold voltages has resulted in lowered noise margins. Most CMOS circuits continue to have considerable immunity to power supply and substrate noise even with the aggressive scaling used today. However, the effect of capacitive coupling noise has become a major concern for designers of deep sub-micron circuits. Compounding these problems is the fact that there are very few, if any, reliable tools for detecting coupling noise on large and complex digital circuits.This paper discusses the coupling noise analysis method used during the development of the UltraSPARC-III microprocessor. A good noise analysis strategy should not only pick out the noise violations in a design but also be robust enough to run a sensitivity analysis, with the aim of recommending solutions to the problems found. The model presented places emphasis on its scalability to large datasets, such as the design database of modern high performance microprocessors, comprising of several million transistors. A hierarchical approach to achieve this is proposed and the capacity achieved is illustrated with results on real circuits.
Correct-by-Design CAD Enhancement for EMI Signal Integrity
Authors: Erik A. McShane, Krishna Shenai
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The monolithic integration of' mixed-signal and RF microelectronics is straining the capabilities of present CAD tools ,for predictive analysis. In particular, the effects of di/dt, crosstalk, high-frequency impedance matching. and substrate noise pose challenges to reliable circuit operation.This is especially true as supply rail voltages continue to shrink below, 2.5 V. Although PCB CAD tools have successfully addressed these issues, similar tools have yet to penetrate the VLSIC/RFIC market due to the even greater signal frequencies and far greater network density.We describe an on going research effort to introduce models of these effects into a commercial CAD tool. The goal is to develop a correct-by-design CAD system in which constraints on signal crosstalk and EMI are considered along with signal delay and power restrictions in performing automated floorplanning and routing. To permit top-down synthesis of reliable systems, we are also expanding the HDL coding of digital systems to include two additional parameters: EMI victim status und EMI point-source contributions.
Reasoning about the dynamics of social behaviour
Authors: Maria Fasli
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper a formal analysis of the behaviour of social agents that can be individual (BDI) agents or aggregations of agents is presented. The central idea is that stability and regulation of activity within a multi-agent system can be accounted for by means of a complex web of roles, commitments, obligations and rights. In particular, commitments are considered to be the attitudes that hold a group of agents together. In pursuit of their own objectives as well as in order to support their collective commitments, agents adopt roles and undertake social commitments. Being semi-autonomous they may decide to drop their commitments and roles, but they may have to bear the consequences of the other agents' prerogative to exercise their rights.
Embedding an interpreted language using higher-order functions and types
Authors: Norman Ramsey
Venue: Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators (2003)

Using an embedded, interpreted language to control a complicated application can have significant software-engineering benefits. But existing interpreters are designed for embedding into C code. To embed an interpreter into a different language requires a suitable API. Lua-ML is a new API that uses higher-order functions and types to simplify the use of an embedded interpreter. A typical application-program function can be added to a Lua-ML interpreter simply by describing the function's type.
Pairing Heaps Are Suboptimal
Authors: Michael L. Fredman
Venue:  (1997)

Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been verified that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been observed to be superior to Fibonacci heaps in practice. However, as demonstrated in this paper, pairing heaps do not accommodate decrease key operations in constant amortized time. 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
Evolving small neurocontrollers with self-organized compact encoding
Authors: Shlomy Boshy, Eytan Ruppin
Venue: Artificial Life (2003)

This article presents a novel method for the evolution of artificial autonomous agents with small neurocontrollers. It is based on adaptive, self-organized compact genotypic encoding (SOCE) generating the phenotypic synaptic weights of the agent's neurocontroller. SOCE implements a parallel evolutionary search for neurocontroller solutions in a dynamically varying and reduced subspace of the original synaptic space. It leads to the emergence of compact successful neurocontrollers starting from large networks. The method can serve to estimate the network size needed to perform a given task, and to delineate the relative importance of the neurons composing the agent's controller network.
State Assignment Techniques in Multiple-Valued Logic
Authors: K. J. Adams, J. G. Campbell, L. P. Maguire, J. A. C. Webb
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Multiple-Valued Logic (MVL) functions are implemented via Boolean multiple-wire arrangements where a careful state assignment methodology is used to ensure efficient implementation regimes. A 'power of N' module is proposed for GF (23). The method avoids the need to factorize the polynomial and circuits can be realised using a combination of NOT AND and XOR functions. In addition, a novel transform over GF (22) is proposed which shows promise when compared to the Reed-Muller-Fourier transform, in its capacity to produce zero co-efficients. A possible implementation strategy, using Field Programmable Gate Arrays (FPGAs) is briefly discussed.
An Empirical Study of Speed and Communication in Globally Distributed Software Development
Authors: James D. Herbsleb, Audris Mockus
Venue: IEEE Transactions on Software Engineering (2003)

Global software development is rapidly becoming the norm for technology companies. Previous qualitative research suggests that distributed development may increase development cycle time for individual work items (modification requests). We use both data from the source code change management system and survey data to model the extent of delay in a distributed software development organization and explore several possible mechanisms for this delay. One key finding is that distributed work items appear to take about two and one-half times as long to complete as similar items where all the work is colocated. The data strongly suggest a mechanism for the delay, i.e., that distributed work items involve more people than comparable same-site work items, and the number of people involved is strongly related to the calendar time to complete a work item. We replicate the analysis of change data in a different organization with a different product and different sites and confirm our main findings. We also report survey results showing differences between same-site and distributed social networks, testing several hypotheses about characteristics of distributed social networks that may be related to delay. We discuss implications of our findings for practices and collaboration technology that have the potential for dramatically speeding distributed software development.
Single Machine Scheduling with Earliness and Tardiness Penalties: When is an Optimal Solution Not Optimal?
Authors: N. V.R. Mahadev, A. Pekec, F. S. Roberts
Venue:  (1995)

We consider the problem of finding the optimal schedule for jobs on a single machine when there are penalties for both late and early arrivals. We point out that if attention is paid to how certain parameters are measured, then a change of scale of measurement might lead to the anomalous situation where a schedule is optimal if these parameters are measured in one way, but not if they are measured in a different way that seems equally acceptable. We discuss conditions under which this anomaly is avoided.
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Authors: Xiaotong Zhuang, Santosh Pande
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Mobile code carried by a mobile agent canautomatically travel to several data sources in order tocomplete a designated program. Traditionally, most mobileagent systems [7][8][13] need explicit involvement of theprogrammer to designate migration and computationschedule of the agent. In this paper, we study the compiler-supportedagent scheduling to optimize either the number ofthe migrations or the amount of data transfer. Twoapproaches are proposed and evaluated in our experiments,i.e. the static and dynamic scheduling algorithms. The firstalgorithm works totally offline. After converting the programcontrol flow graph (CFG) to program dependency graph(PDG), the schedule is worked out. On the other hand, inorder to dynamically schedule the agent when it reachespredicate (control flow) nodes, our dynamic schedulingalgorithm generates the motion schedule incrementally.Finally, our results show good improvement overunoptimized agent code both in terms of data transfer sizesand number of agent migrations.
Simulating TRSs by minimal TRSs: a simple, efficient, and correct compilation technique
Authors: Jasper F.T Kamperman, H. R. Walters
Venue:  (1996)

A simple, efficient, and correct compilation technique for left-linear Term Rewriting Systems (TRSs) is presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs, presented in [KW95d]. In MTRSs, the rules have such a simple form that they can be seen as instructions for an easily implementable abstract machine, the Abstract Rewriting Machine (ARM). In the correctness proof, it is shown that the MTRS resulting from compilation of a TRS simulates neither too much (soundness) nor too little (completeness), nor does it introduce unwarranted infinite sequences (termination conservation). The compiler and its correctness proof are largely independent of the reduction strategy.
Software Rules: How the Next Generation of Enterprise Applications Will Increase Strategic Effectiveness, 1 edition
Authors: Mark J. Barrenechea, Marc Singer
Venue:  (2002)

:"Information technology is the Rubik's Cube of the 21st century. Executives first try this combination of software solutions, then that combination, and still find it difficult if not impossible to assemble a basket of solutions that makes everything work." Software Rules proposes that the basket approach itself may be the problem. This intuitive and innovative book proposes the e-business suite - a complete business software platform that, because it has been engineered by one vendor around a unified global customer and product database, requires no custom programming or architectural reconstruction for full integration.
Resource Scheduling for Coordinated Display of Structured Presentations Using a Multi-Disk Architecture
Authors: M. L. Escobar-Molano, S. Ghandeharizadeh
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

M. L. Escobar-Molano and S. Ghandeharizadeh Abstract: A structured presentation consists of a collection of objects (3-D representations) with spatial and temporal constraints along with rendering features such as shading and the audiences' view point. A challenging task is to schedule the retrieval of objects from disk to display a presentation in real-time. This study introduces a taxonomy of such scheduling techniques and three techniques to support the display of structured presentations assuming a multi-disk architecture. These heuristics are evaluated using a simulation study to quantify their trade-offs. The results are compared with a theoretical minimum, demonstrating that one of the pro-posed techniques provides a performance almost identical to this minimum.
Performance Evaluation of the Stony Brook Video Server
Authors: Tzi-cker Chiueh, Michael Vernick, Chitra Venkatramani
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

Stony Brook VideoServer (SBVS) is an Ethernet-basedvideo server that employs only off-the-shelf PC components and is capable of guaranteeing real-time deliveryof digital video streams from the server's disk subsystem,through a shared local area network to an end user's display. SBVS integrates a real-time software-based diskarray with a Real-Time Ethernet Protocol, RETHERto provide end-to-end bandwidth guarantee. This paper reports the results of a detailed performance evaluation study of SBVS, specifically the efficiency with whichSBVS utilizes the hardware capabilities of Fast Ethernet and SCSI disks in the context of video servers, andthe overhead of integrating real-time I/O and networkcomponents into a complete system. Two sets of experiments were performed: (1) experiments that measure themaximum performance of individual I/O and networkhardware when operating based on the algorithms usedin SBVS; and (2) experiments that evaluate SBVS as awhole in terms of the maximum number of video streamsthat can be supported under varying stream rates, diskretrieval sizes, and number of network interfaces. Themajor results are that SBVS-2, a Pentium-90 PC witha four-drive disk array and a single Mbps Ethernet can support up to a maximum of simultaneous MPEG-1 (1.5 Mbits/sec) streams, and that usinga six-drive array and serving two Mbps Ethernetsegments, SBVS can support up to a maximum of 65MPEG-1 streams, with CPU being the performance bottleneck.
The Practical Side of Quality
Authors: John East
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

My practical definition of quality is getting it right the first time, on time. The downsides of poor quality work need no explanation. Unfortunately, though, the consequences of being late to market can doom any potential market advantage. The only sure win comes when the product is both high quality and on time. To help assure on-time delivery of working ICs, I advocate "two-handed management". This means with one hand, do the job as best you can using the tools and techniques available, but with the other hand, take steps to see similar jobs are done better and faster the next time. An example of two-handed management in the distant past was the development of various simulation techniques. The two-handed manager of the future will look for silicon with advanced capabilities in the areas of "observability," "tweakability" and incremental specification techniques as well as inherent improvements in speed, power and cost.
Real-time disk scheduling in a mixed-media file system
Authors: H. G.P. Bosch, Sape J. Mullender
Venue:  (2000)

This paper presents our real-time disk scheduler called the $\Delta L$ scheduler, which optimizes unscheduled best-effort disk requests by giving priority to best-effort disk requests while meeting real-time request deadlines. Our scheduler tries to execute real-time disk requests as much as possible in the background. Only when real-time request deadlines are endangered, our scheduler gives priority to real-time disk requests. The $\Delta L$ disk scheduler is part of our mixed-media file system called Clockwise. An essential part of our work are extensive and detailed raw disk performance measurements. These raw performance measurements are used by the $\Delta L$ disk scheduler for its real-time schedulability analysis and to decide whether scheduling a best-effort request before a real-time request violates real-time constraints. Further, the raw performance measurements are used by a Clockwise off-line simulator where a number of different disk schedulers are compared. We compare the $\Delta L$ scheduler with a prioritizing \emph{Latest Start Time} (\textsc{lst}) scheduler and non-prioritizing \textsc{edf} scheduler. The $\Delta L$ scheduler is comparable to \textsc{lst} in achieving low latencies for best-effort requests under light to moderate real-time loads and better in achieving low latencies for best-effort requests for extreme real-time loads. The simulator is calibrated to an actual Clockwise. Clockwise runs on a 200\,\textsc{mh}z Pentium-Pro based \textsc{pc} with \textsc{pci} bus, multiple \textsc{scsi} controllers and disks on Linux 2.2.x and the Nemesis kernel. Clockwise''s performance is dictated by the hardware: all available bandwidth can be committed to real-time streams, provided hardware overloads do not occur.
Decomposition and Reduction of Directed Acyclic Graphs
Authors: F M M Stallmann., W W Bein
Venue:  (1988)

Many graph and network problems are easy to solve if the underlying graph is series-parallel. Algorithms on series-parallel graphs use the fact that a series-parallel graph can be efficiently parsed into a decomposition tree or that it can be reduced to a single edge by a sequence of simple reductions. Both notions (decomposition tree and reduction sequence) can be generalized to apply to an arbitrary directed acyclic graph (DAG). We show that the problem of minimizing the number of node reductions (or node duplications) required to reduce a DAG to a single edge is equivalent to the problem of minimizing the number of duplicated subexpressions in a generalized decomposition tree, and that both of these problems can be solved in polynomial time. Applications include the analysis of PERT networks, dynamic programming approaches to network problems, network reliability, and solving NP-hard problems on graphs that are ``almost'''' series-parallel.