ppxscal/embedding_network huggingface dataset:
Silicon compilation of switched: capacitor networks
Authors: Mehrdad Negahban, Daniel Gajski
Venue: Proceedings of the conference on European design automation (1990)

Design techniques and methodologies for silicon compilation of switched-capacitor (SC) networks consisting of SC blocks is described in this paper. It requires a set of specifications and a circuit description of each SC block. The operational amplifier (opamp) synthesis is based on the selection and assembly of primitive modules to form an opamp circuit topology. Style selection is done through a Decision-Decomposition Tree to provide an initial result. The result is finalized through an iterative algorithm using SPICE program. The layout strategy and architecture are such that they eliminate any crossover of sensitive signals by undesired signals; thus avoiding any special routing algorithm for sensitive routing. The result is a stand alone layout of a SC block which can be placed and routed with other SC blocks or analog and digital cells using a general auto placement and router tool.
Surveys as a method for improving the development process
Authors: Joe Wigglesworth
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Traditionally, project teams wait until the product has been shipped to customers before surveying the project participants for their thoughts on what went right and what went wrong. These surveys are usually called "postmortems" and the cadaver analogy is appropriate: it is too late to do anything to help the patient.A solution is to check the patient's vital signs at regular intervals and prescribe treatment as required. This was the approach taken in a pilot study run recently in the Image Systems Center of the IBM' PRGS Toronto Laboratory. At predefined project checkpoints, a survey was sent to all participants of the pilot project to solicit their anonymous feedback about what was working well and what needed changing.The questions in the survey were designed to be generic so that the same set of questions could be used for each checkpoint, in order that comparisons could be made between checkpoints. Groups of related questions were created, each having several multiple-choice questions and one free-form text question so that both qualitative and quantitative feedback was obtained. The quantitative results were analyzed for trends, and the qualitative results were examined for evidence of specific process defects. In the later stages of thg pilot study, a follow-up meeting was held so that project members could discuss the identified process defects and suggest action items to avoid the defect in the future.The results of this pilot study were positive, and there is good reason to extend this survey approach to other areas of the Laboratory. It is a natural enhancement to the Defect Prevention Process, and an aid for meeting the corrective action procedures requirement of ISO 9000 registration.
Higher Order Logarithmic Derivatives of Matrices in the Spectral Norm
Authors: Rajendra Bhatia, Ludwig Elsner
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

For the spectral norm $||.||$ on n &times; n complex matrices, we derive the first three right-hand derivatives of $\phi(t)= ||e^{tA}||$ at t=0. The first one is the well-known logarithmic derivative. This study was inspired by a recent result by Kohaupt, where the second derivative is studied for the lp norms, $p=1,\infty$.
A visualization of the primal simplex algorithm for the assignment problem
Authors: Charalampos Papamanthou, Konstantinos Paparrizos
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

An educationally-oriented Visualization Software used to assist the teaching of the Primal Simplex Algorithm for the Assignment Problem is presented.
An assessment model for requirements identification in component-based software development
Authors: Hemant Jain, Padmal Vitharana, Fatemah "Mariam" Zahedi
Venue: ACM SIGMIS Database (2003)

Software development literature is replete with studies that demonstrate how ineffective requirements analysis (RA) has led to failed applications. Some of the difficulties encountered in RA however are due to inherent limitations in traditional approach to software development. On the other hand, component-based software development (CBSD) presents a unique approach to developing software. Components advertise the services they offer and could be organized in a knowledge-base (i.e., repository). CBSD paradigm provides an effective communication vehicle for users and analysts by enabling them to uncover requirements as they navigate through the component knowledge-base.In this paper, we draw from the information processing theory (IPT) on problem solving to develop an assessment model for evaluating the impact of CBSD on requirements identification, arguing that the access to components in a knowledge-base facilitates the requirements identification. The key elements of the IPT on problem solving are information processing system of the problem solver, task environment and internal representation of the problem space. We propose that access to a component knowledge-base enhances information processing system of the problem solver and simplifies the task environment which together improve user's internal representation of the problem space. This theoretical framework makes it possible to empirically test the impact of CBSD on requirements identification process.
Mac OS X: The Missing Manual, Panther Edition
Authors: David Pogue
Venue:  (2003)

With new material on practically every page, the latest update of David Pogue's best-selling title offers a wealth of detail on the all of the changes in Apple's Mac OS X 10.3, aka "Panther". Written with humor and technical insight characteristic of the Missing Manual series, the new edition covers everything from the all-new Finder to iChat AV--Apple's exciting tool for video conferencing. The book also deals with features under the hood, such as the Terminal and networking tools. Pogue, the renowned New York Times computer columnist, tackles his subject with scrupulous objectivity--revealing which new features work well and which do not. An authoritative book that will appeal to novices and experienced users alike.
Extensions of certain classical integrals of Erd&#x00E9;lyi for Gauss hypergeometric functions
Authors: C. M. Joshi, Yashoverdhan Vyas
Venue: Journal of Computational and Applied Mathematics (2003)

It is shown how series manipulation technique and certain classical summation theorems for hypergeometric series can be used to prove Erdélyi's integral representations for 2F1(z), originally proved using fractional calculus. The method not only leads to generalizations but also leads to new integrals of Erdélyi type for certain q+1Fq(z) and corresponding Pochhammer contour integrals. The technique outlined here, compared to the method of fractional calculus, seems to be more effective as it not only provides transparent elementary proofs of Erdélyi's integrals but even leads to various generalizations.
Input-output structure and growth in China
Authors: Baiding Hu, Michael McAleer
Venue: Mathematics and Computers in Simulation (2004)

The fast and steady economic growth in China during the 1990s has attracted much international attention. Using the three most recent Chinese input-output tables, this paper investigates industry structure and inter-industry relationships and the relationship of both to economic growth. The input-output tables contain intermediate demand and final demand for six broad industries, namely, Agriculture, Industry, Construction, Transportation, Post and Telecommunications, Services, and Others, for 1992, 1995 and 1997, which enables computing of input-output coefficients for three time periods. As direct and indirect input-output coefficients characterise industry structure during a particular time period, changes over time reflect the patterns in industry structure evolvement. Furthermore, output growth in a particular industry can be analysed from two different sources, namely the changes in input-output coefficients that reflect technological change, and the change in final demand. This paper sheds fight on four different issues over the five-year period from 1992 to 1997: (1) Was growth driven by technological changes or final demand increases? (2) As a result of the interdependence of industries, how did an increase in final demand in one industry affect growth in another? (3) How has the bottleneck of an insufficient capability in the transportation, post and telecommunications sectors to cope with demands from other sectors been affected during this period? (4) Has the industry structure of the economy been shifting in conformity with traditional growth theory, namely, with a decline in the agricultural sector and a rise in the modern industrial sector?
Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Venue: Data Warehousing and OLAP (2003)

Data Warehouses are databases specialized for business intelligence applications, and have been rapidly spreading within the industrial world over the last decade, due to their undeniable contribution to increasing the effectiveness and efficiency of the decision process within business and scientific domains. This wide diffusion was supported by remarkable research results on the one hand, by the quick advancement of commercial tools on the other.The ACM International Workshop on Data Warehousing and Online Analytical Processing (DOLAP) is an annual event that provides an international forum where both researchers and practitioners can share their findings in theoretical foundations, current methodologies, practical experiences, and new research directions in the areas of data warehousing and online analytical processing. The sixth DOLAP workshop was held this year in New Orleans, LA, USA.This year, we received 28 submissions form 16 different countries. The submitted papers covered various aspects of Data Warehousing and OLAP including ETL processes, multidimensional modeling, query languages, optimization and tuning, physical organization of data warehouses, data quality, evolution, XML data warehouses. After careful review, 12 papers were selected by the program committee to be presented at the workshop and included in the proceedings. The accepted papers were presented in four sessions: OLAP, XML and architecture, query processing, maintenance and workload.
Data at work: supporting sharing in science and engineering
Authors: Jeremy P. Birnholtz, Matthew J. Bietz
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Data are a fundamental component of science and engineering work, and the ability to share data is critical to the validation and progress of science. Data sharing and reuse in some fields, however, has proven to be a difficult problem. This paper argues that the development of effective CSCW systems to support data sharing in work groups requires a better understanding of the use of data in practice. Drawing on our work with three scientific disciplines, we show that data play two general roles in scientific communities: 1) they serve as evidence to support scientific inquiry, and 2) they make a social contribution to the establishment and maintenance of communities of practice. A clearer consideration and understanding of these roles can contribute to the design of more effective data sharing systems. We suggest that this can be achieved through supporting social interaction around data abstractions, reaching beyond current metadata models, and supporting the social roles of data.
Japanese discourse and the process of centering
Authors: Marilyn Walker, Sharon Cote, Masayo Iida
Venue: Computational Linguistics (1994)

This paper has three aims: (1) to generalize a compulational account of the discourse process called CENTERING, (2) to apply this account to discourse processing in Japanese so that it can be used in computational systems for machine translation or language understanding, and (3) to provide some insights on the effect of syntactic factors in Japanese on discourse interpretation. We argue that while discourse interpretation is an inferential process, syntactic cues constrain this process; we demonstrate this argument with respect to the interpretation of ZEROS, unexpressed arguments of the verb, in Japanese. The syntactic cues in Japanese discourse that we investigate are the morphological markers for grammatical TOPIC, the postposition wa, as well as those for grammatical functions such as SUBJECT, ga, OBJECT, o and OBJECT2, ni. In addition, we investigate the role of speaker's EMPATHY, which is the viewpoint from which an event is described. This is syntactically indicated through the use of verbal compounding, i.e. the auxiliary use of verbs such as kureta, kita. Our results are based on a survey of native speakers of their interpretation of short discourses, consisting of minimal pairs, varied by one of the above factors. We demonstrate that these syntactic cues do indeed affect the interpretation of ZEROS, but that having previously been the TOPIC and being realized as a ZERO also contributes to the salience of a discourse entity. We propose a discourse rule of ZERO TOPIC ASSIGNMENT, and show that CENTERING provides constraints on when a ZERO can be interpreted as the ZERO TOPIC.
What we've learned: Design and design centers in engineering education
Authors: Steven J. Fenves
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The article is an extended version of the verbal summary presented at the concluding lunch of the workshop on &ldquo;Computing Futures in Engineering Design.&rdquo; In the paper, the first person is used to differentiate my observations or reactions from the summaries of the speakers' presentations. The common themes that emerge during the workshop are: the need to set the discipline-specific context before computational tools are used; the incompatibilities between point tools that hinder their use; the paramount importance of teamwork; and the need to understand and treat design as a social process.
Geometry and concurrency: a user's guide
Authors: Eric Goubault
Venue: Mathematical Structures in Computer Science (2000)

Geometrical methods in concurrency theory (and in distributed systems theory) have appeared recently for modelling and analyzing the behaviour of systems and also for solving computability and complexity issues. We identify some of the main directions of research, and survey some of the major ideas on which all this is based (some of which are now more than thirty years old).
Using Knowledge-Based Systems to Support Learning of Organizational Knowledge: A Case Study
Authors: Lynne P. Cooper, Rebecca L. Nash, Tu-Anh T. Phan, Teresa R. Bailey
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This paper describes the deployment of a knowledge system to support learning of organizational knowledge at the Jet Propulsion Laboratory (JPL), a US national researchlaboratory whose mission is planetary exploration and to "do what no one has done before." Data collected over 19 weeks of operation were used to assess system performance with respect to design considerations, participation, effectiveness of communication mechanisms, and individual-based learning. These results are discussed in the context of organizational learning research and implications for practice.
Optimal broadcasting in injured hypercubes using directed safety levels
Authors: Jie Wu
Venue: Journal of Parallel and Distributed Computing (2003)

Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hypercube (n-cube) is associated with a sequence of directed safety levels. A directed safety level associated with node u is an approximated measure of broadcast capability of performing optimal broadcasting from u in an (n - 1)-subcube containing u. By optimal broadcasting, we mean that the broadcast message reaches each destination through a shortest path (i.e., the length of each path is equal to the Hamming distance between the source and destination). Directed safety levels are based on a special coding scheme generalized from Wu's safety level model and are calculated through n - 1 rounds of information exchanges and updates among neighboring nodes. In this model, fault information of nodes within distance-d is precisely represented to better capture link faults, whereas fault information of nodes outside distance-d is approximated as in the regular safety level model. Optimal broadcasting at node u is guaranteed if node u is globally safe, which is defined in terms of the directed safety levels associated with u. The directed safety level model with d = 1 or d = 2 has the same asymptotic complexity as the regular safety level model. Simulation results show a significant improvement in terms of optimal broadcast capability in injured hypercubes.
Using Supervisory Control to Synthesize Safety Controllers for Connected Spaces
Authors: Baskar Sridharan, Aditya P. Mathur, Kai-Yuan Cai
Venue: Proceedings of the Third International Conference on Quality Software (2003)

A procedure for synthesizing safety controllers for pervasivecomputing environments is described. Control-theoretictechniques are used in the synthesis. We describethe notions of Connected Spaces and Digital Device Manualsfor modeling pervasive computing environments anddevices, respectively. The safety requirements for the environmentare specified as a set of safety policies. Thesafety policies are enforced by the safety controller. The notionsof policy relaxation cost of the safety policies andsafety criticality ranking of the devices are novel to thiswork. An experimental evaluation of the synthesis procedureis presented. Results show that the synthesis procedurescales linearly with respect to the density of the set of policies.
An echo from closed doors
Authors: David Hirst
Venue: Organised Sound (2001)

On 31 December 1999 the La Trobe University Music Department closed its doors. From the outset, La Trobe Music saw itself as providing an alternative tertiary music education to the predominant paradigms of the time by fostering creativity through composition, technology, improvisation and other types of alternative performance practices. The philosophy of teaching electroacoustic music at La Trobe was to encourage students to find their own compositional voice rather than preach a particular style of electroacoustic music. The Department's research areas were in improvisation and technology, signal processing, gestural control devices, computer-assisted composition, analysis of electroacoustic music, realtime DSP, live electronics and installations. La Trobe's excellence in electroacoustic music was recognised by its inclusion in a survey of the world's top twenty-three computer music institutions by the Japanese journal Intercommunication 6. La Trobe staff and postgraduate students contributed papers and compositions to international and national computer music conferences and La Trobe was very much a part of the international community for over twenty-five years. The challenge now is for other Victorian institutions to meet the needs of today's students and to provide the deep research foundation in electroacoustic music that informs teaching and generates new music directions in the community.
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
Authors: Van H. Vu
Venue: Combinatorics, Probability and Computing (2002)

Suppose that G is a graph with maximum degree d(G) such that, for every vertex v in G, the neighbourhood of v contains at most d(G)2&#x002F;f (f > 1) edges. We show that the list chromatic number of G is at most Kd(G)&#x002F;log f, for some positive constant K. This result is sharp up to the multiplicative constant K and strengthens previous results by Kim [9], Johansson [7], Alon, Krivelevich and Sudakov [3], and the present author [18]. This also motivates several interesting questions.As an application, we derive several upper bounds for the strong (list) chromatic index of a graph, under various assumptions. These bounds extend earlier results by Faudree, Gy&aacute;rf&aacute;s, Schelp and Tuza [6] and Mahdian [13] and determine, up to a constant factor, the strong (list) chromatic index of a random graph. Another application is an extension of a result of Kostochka and Steibitz [10] concerning the structure of list critical graphs.
Visual panel: virtual mouse, keyboard and 3D controller with an ordinary piece of paper
Authors: Zhengyou Zhang, Ying Wu, Ying Shan, Steven Shafer
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

This paper presents a vision-based interface system, VISUAL PANEL, which employs an arbitrary quadrangle-shaped panel (e.g., an ordinary piece of paper) and a tip pointer (e.g., fingertip) as an intuitive, wireless and mobile input device. The system can accurately and reliably track the panel and the tip pointer. The panel tracking continuously determines the projective mapping between the panel at the current position and the display, which in turn maps the tip position to the corresponding position on the display. By detecting the clicking and dragging actions, the system can fulfill many tasks such as controlling a remote large display, and simulating a physical keyboard. Users can naturally use their fingers or other tip pointers to issue commands and type texts. Furthermore, by tracking the 3D position and orientation of the visual panel, the system can also provide 3D information, serving as a virtual joystick, to control 3D virtual objects.
Integrating patterns into CASE tools
Authors: Joan Peckham, Scott J. Lloyd
Venue: Practicing software engineering in the 21st century (2003)

Software patterns are used to facilitate the reuse of object-oriented designs. While most Computer Aided Software Engineering (CASE) tools support the use of Unified Modeling Language (UML) (Alhir & Oram, 1998) to extract the design from the software engineer and assist in development, most do not provide assistance in the integration and code generation of software patterns. In this chapter, we analyze the Iterator software pattern (Gamma et al., 1995) for the semantics that would be used in a CASE-design tool to help the software engineer to integrate this pattern into a design and then generate some of the code needed to implement the pattern. This work is based on semantic data modeling techniques that were previously proposed for the design of active databases (Brawner, MacKellar, Peckham & Vorbach, 1997; Peckham, MacKellar & Doherty, 1995).
A framework for hierarchical performance analysis
Authors: Farid M. Saadi, Bozena Kaminska
Venue: Proceedings of the conference on European design automation (1991)

The performance analysis of VLSI integrated circuits (ICs) with flat tools is slow and even sometimes impossible to complete. Some hierarchical tools have been developed to speed up the analysis of these large ICs. However, these hierarchical tools suffer from a poor interaction with the CAD database and poorly automatized operations. We introduce a general hierarchical framework for performance analysis to solve these problems. The circuit analysis is automatic under the proposed framework. Information that has been automatically abstracted in the hierarchy is kept in database properties along with the topological information. A limited software implementation of the framework, PREDICT, has also been developed to analyze the delay performance.