ppxscal/embedding_network huggingface dataset:
Session III Structured Programming: Problems, Approaches, and Techniques
Authors: R. R. Brown
Venue: Computer (1975)

The third session dealt with the problems, approaches, and techniques associated with the advancement, development, and implementation of structured programming. The two papers that follow are typical of ideas presented during this session. "Structured Programming: Agony and/or Ecstasy," by John Brown, provides some practical guidelines for introducing any software discipline into an organization. He makes a strong case for a business-like approach-i.e., enlightened management committed to well-defined objectives. 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
The quest for quality tags
Authors: Shilad Sen, F. Maxwell Harper, Adam LaPitz, John Riedl
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Many online communities use tags - community selected words or phrases - to help people find what they desire. The quality of tags varies widely, from tags that capture akey dimension of an entity to those that are profane, useless, or unintelligible. Tagging systems must often select a subset of available tags to display to users due to limited screen space. Because users often spread tags they have seen, selecting good tags not only improves an individual's view of tags, it also encourages them to create better tags in the future. We explore implicit (behavioral) and explicit (rating) mechanisms for determining tag quality. Based on 102,056 tag ratings and survey responses collected from 1,039 users over 100 days, we offer simple suggestions to designers of online communities to improve the quality of tags seen by their users.
Training for Global Software Development in an International "Learning Network"
Authors: Benedikt Lutz
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Siemens Austria's Program and System Engineering Division SIS PSE has moved away from the classic approach of offering training via an inhouse Training Center towards a new approach called "Learning Network". This Learning Network is part of PSE wide international knowledge networking, and consists of about 100 internal trainers, who perform their training activities beside their main job as engineers, project managers, quality managers, or the like. Given the organization's set-up in a global software development environment, this has particular advantages in terms of international standardization of content (where needed), provision of local content, cost, and pedagogical efficiency. This paper briefly outlines the challenges PSE is faced with, introduces the approach adopted by PSE in detail, gives three examples of training for skills development specifically needed in global software development, highlights the critical success factors of such an approach, and provides a résumé.
Sequential Machine Identification
Authors: J. Kella
Venue: IEEE Transactions on Computers (1971)

A special aspect of sequential machine identification is treated in this paper. Given an input signal sequence to an unknown sequential machine and the resulting output signal sequence of the machine, it is necessary to find a state table or any other description of the machine and all other machines which response to the given input sequence with the given output sequence. The main objective of the research was to develop a fast and efficient state merging method which profits from the special characteristics of the problem at hand.
High-level synthesis of digital microfluidic biochips
Authors: Fei Su, Krishnendu Chakrabarty
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2008)

Microfluidic biochips offer a promising platform for massively parallel DNA analysis, automated drug discovery, and real-time biomolecular recognition. Current techniques for full-custom design of droplet-based &ldquo;digital&rdquo; biochips do not scale well for concurrent assays and for next-generation system-on-chip (SOC) designs that are expected to include microfluidic components. We propose a system design methodology that attempts to apply classical high-level synthesis techniques to the design of digital microfluidic biochips. We focus here on the problem of scheduling bioassay functions under resource constraints. We first develop an optimal scheduling strategy based on integer linear programming. However, because the scheduling problem is NP-complete, we also develop two heuristic techniques that scale well for large problem instances. A clinical diagnostic procedure, namely multiplexed in-vitro diagnostics on human physiological fluids, is first used to illustrate and evaluate the proposed method. Next, the synthesis approach is applied to a protein assay, which serves as a more complex bioassay application. The proposed synthesis approach is expected to reduce human effort and design cycle time, and it will facilitate the integration of microfluidic components with microelectronic components in next-generation SOCs.
On engineering standards based carrier grade platforms
Authors: Francis Tam
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

The remarkable pace of advancement in communications technologies and the exponential growth of the market have pressured network equipment providers into producing more features in products in a much faster rate at lower costs. The strategy of buying constituent components instead of building one's own has shown promises in achieving these goals. In this paper, we articulate the needs for following standards, and discuss the impact and the required changes for engineering a standards based carrier grade platform. The focus is on the introduction of an availability management middleware, in the form of an off-the-shelf component, and its impact on the product life cycle. By applying and adapting a selection of research results from the dependability community, we show that the telecommunications industry can benefit and achieve its target of reducing development costs.
Hardware Technology in the Year 2001
Authors: J. W. Bremer
Venue: Computer (1976)

Twenty-five years ago computers were a collection of boxes in a room, with input, output, memory, and central processor. Programs could be stored and manipulated just like data. Although computers in those days were used mostly for numerical calculations, it was clear that the sorting functions could be used for non-numerical applications. The notion of higher-level languages was around. Some of the hardware utilized transistors (although perhaps point contact germanium); and punched cards and drums were common. Magnetic core memeory and magnetic tape were being developed. The boxes in the computer room had lots of switches and lights, and the people manipulating these were clearly of an elite (if not yet quite professional) class.
Computational framework for investigation of aircraft nonlinear dynamics
Authors: M. G. Goman, A. V. Khramtsovsky
Venue: Advances in Engineering Software (2008)

A computational framework based on qualitative theory, parameter continuation and bifurcation analysis is outlined and illustrated by a number of examples for inertia-coupled roll maneuvers. The focus is on the accumulation of computed results in a special database and its incorporation into the investigation process. Ways to automate the investigation of aircraft nonlinear dynamics are considered.
A GPU-based method for real-time simulation of Eastern painting
Authors: The Kiet Lu, Zhiyong Huang
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Different from Western Paintings, one can only appreciate the beauty of Eastern paintings by looking at its "spiritual" aspects: "a liking of simpleness with subtlety" -- The Art of Sumi-e. It is the careful brushwork with abstract strokes that embrace chance while leaving nothing up to chance, from any subtle changes in brush's pressure onto the paper to the fascinating ink diffusion absorbed by painting papers with various microstructures. Hence, the goal of this research work aims to "capture" these expressivenesses of the Eastern Arts, in digitalized form, which will open to new opportunities of exploration of painting techniques on the new digital Media, as well as of the easiness of calligraphical practices, complementary to the traditional way. By combining the flexibility from CPU and the power of GPU parallelism, together with carefully scheduling the simulation tasks between CPU and GPU, we have achieved good results with high visual quality and also are able to fulfill the requirement of real-time simulation.
Watershed Segmentation Using a Multiscale Ramp Edge Merging Strategy
Authors: Padraig Corcoran, Adam Winstanley
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

For the watershed segmentation algorithm to be successful it must be implemented on a realistic gradient image. In most watershed implementations, gradients are extracted using an operator optimal for ideal step edges. However, image edges are never ideal steps and more closely resemble ramp edges at multiple scales. Therefore this strategy results in an inaccurate measure of image gradients and in turn lessens segmentation performance. In this paper we propose a new multiscale gradient operator for ramp edges. This strategy merges the properties of accurate gradient estimation of a large scale kernel with accurate localization of a small scale kernel by tracking gradients from larger to smaller scales. Quantitative performance evaluation of segmentation results shows this approach to outperform a traditional single small scale gradient operator optimal for step edges.
Dynamic re-negotiations of SLA in service composition scenarios
Authors: Giuseppe Di Modica, Valerio Regalbuto, Orazio Tomarchio, Lorenzo Vita
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

In a SOA environment services are implemented on top of resources across different administrative domains, in which IT infrastructure and internal resources are managed according to autonomous policies. Service Providers and their customers negotiate utility based Service Level Agreements (SLAs) to determine costs and penalties based on the achieved performance levels. In B2B scenarios where several service providers are involved in the composition of a service, and each of them plays both the parts of provider and customer, several one-to-one SLAs need to be signed. In such a rigid context the global QoS of the final service can be strongly affected by any violation on each single SLA. In order to prevent such violations, SLAs need to flexible during service provision. The WS-Agreement specification, developed by the Global Grid Forum, is a Web Service protocol to establish agreements on the QoS level to be guaranteed in the provision of a service. The committed WS-Agreement can not be modified during service provision and is effective until all activities pertaining to it are finished or until one of the signing parties decides to terminate it. In this work we focus on this specification and propose to enhance the flexibility of its approach. We integrate new functionality to the protocol that enable the parties of a WS-Agreement to re-negotiate and modify its terms during the service provision, and show how a typical scenario of service composition can benefit from our proposal.
Building a Self-Healing Operating System
Authors: Francis M. David, Roy H. Campbell
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

User applications and data in volatile memory are usu- ally lost when an operating system crashes because of er- rors caused by either hardware or software faults. This is because most operating systems are designed to stop working when some internal errors are detected despite the possibility that user data and applications might still be intact and recoverable. Techniques like exception han- dling, code reloading, operating system component isola- tion, micro-rebooting, automatic system service restarts, watchdog timer based recovery and transactional compo- nents can be applied to attempt self-healing of an operating system from a wide variety of errors. Fault injection exper- iments show that these techniques can be used to continue running user applications after transparently recovering the operating system in a large percentage of cases. In cases where transparent recovery is not possible, individual pro- cess recovery can be attempted as a last resort.
Digital Logic Simulation in a Time-Based, Table-Driven Environment
Authors: E. W. Thompson
Venue: Computer (1975)

Digital simulation is the process of modeling, by computer programs, the behavior of a digital network. Digital fault simulation is the modeling of a digital network in the presence of a physical defect. The term "fault" is used to refer to some representation of a physical defect. A simple example of this is the case where an input connection to an AND gate is broken. This would be referred to as a stuck-at-1 fault. Hence the phrase fault simulation.
Formalising Java RMI with explicit code mobility
Authors: Alexander Ahern, Nobuko Yoshida
Venue: Theoretical Computer Science (2007)

This paper presents an object-oriented, Java-like core language with primitives for distributed programming and explicit code mobility. We apply our formulation to prove the correctness of several optimisations for distributed programs. Our language captures crucial but often hidden aspects of distributed object-oriented programming, including object serialisation, dynamic class downloading and remote method invocation. It is defined in terms of an operational semantics that concisely models the behaviour of distributed programs using machinery from calculi of mobile processes. Type safety is established using invariant properties for distributed runtime configurations. We argue that primitives for explicit code mobility offer a programmer fine-grained control of type-safe code distribution, which is crucial for improving the performance and safety of distributed object-oriented applications.
Algorithms for terminal Steiner trees
Authors: Fábio Viduani Martinez, José Coelho de Pina, José Soares
Venue: Theoretical Computer Science (2007)

The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2@r-@r/(3@r-2) approximation algorithm for the TST, where @r is the approximation factor of a given algorithm for the Steiner tree problem. Considering the current best value of @r, this improves a previous 3.10 factor to 2.52. For the TST restricted to instances where all edge costs are either 1 or 2, we improve the approximation factor from 1.60 to 1.42.
The Multiple Assignment Statement
Authors: D. Gries
Venue: IEEE Transactions on Software Engineering (1978)

The conventional axiomatic definitions are given for multiple assignment to simple variables and for assignment to a single subscripted variable, along with examples to illustrate their use. The original contributions of this paper are the extension of the definition to include multiple assignment to several subscripted variables, and the development of a nontrivial, practical algorithm in which multiple assignment to several subscripted variables is indeed useful. Arguments are given to support the conjecture that the use of subscripted variables, like the use of pointers, can lead to exponential explosion of the length of a proof (and thus of the time needed to understand a program) unless the programmer is careful.
Learning and computers: a pragmatic approach to acquiring an awareness of computerized information processing systems
Authors: Charles H. Hoke
Venue: ACM SIGCPR Computer Personnel (1980)

The managerial grid has been used extensively in efforts to improve organizational management since the late 1950's. The underlying structure of grid theory has been of particular interest to the writer, an adult educator, during these past five years of accelerating awareness of and the need for increased knowledge of computer technology. Instrumented team learning from grid theory has provided a flexible and practical model for courses in management science in university and government settings; courses in systems theory, computer technology and information processing systems. It seemed appropriate that this successful learning model could be most useful in teaching students seeking an understanding of computerized information processing systems and of the computer as an indispensable tool of management.
Abstraction in Assertion-Based Test Oracles
Authors: Yoonsik Cheon
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Yoonsik Cheon Department of Computer Science The University of Texas at El Paso El Paso, TX 79968-0518 ycheon@utep.edu Abstract Assertions can be used as test oracles. However, writ- ing effective assertions of right abstraction levels is difficult because on the one hand, detailed assertions are preferred for thorough testing (i.e., to detect as many errors as possi- ble), but on the other hand abstract assertions are preferred for readability, maintainability, and reusability. As asser- tions become a practical tool for testing and debugging pro- grams, this is an important and practical problem to solve for the effective use of assertions. We advocate the use of model variables--specification-only variables of which ab- stract values are given as mappings from concrete program states--to write abstract assertions for test oracles. We per- formed a mutation testing experiment to evaluate the effec- tiveness of the use of model variables in assertion-based test oracles. According to our experiment, assertions written in terms of model variables are as effective as assertions writ- ten without using model variables in detecting (injected) faults, and the execution time overhead of model variables are negligible. Our findings are applicable to other use of runtime checkable assertions.
Erratum, January Issue
Venue: Computer (1978)

E. Douglas Jensen's article, "The Honeywell Experimental Distributed Processor-An Overview," in the January Computer contained an extra section heading, "Homomorphism and integrity," on p. 30. No heading was intended by the author at this point. We regret the error. 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
A Piecewise Fuzzy Lyapunov Function Approach to Stability Analysis of Discrete T-S Fuzzy System
Authors: Gui-Chen Zhang, Song-Tao Zhang, Guang Ren
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Stability analysis of discrete T-S fuzzy system with the common Lyapunov function approach and the fuzzy Lyapunov function approach is computationally attractive but conservative. Based on the definition of a discrete piecewise fuzzy Lyapunov function at each overlapping rules group, this paper introduces a new sufficient stability condition that only needs satisfying the stability condition of the fuzzy Lyapunov function approach in each maximal overlapped-rules group (MORG). A simulation example shows the condition is less conservative and easier to check than earlier approaches.
An order h4 numerical technique for solving biharmonic equation
Authors: P. K. Pandey, R. K. Mohanty
Venue: Neural, Parallel Scientific Computations (2007)

We develop a fourth order finite difference method for the solution of a nonlinear biharmonic problems with third order derivative terms subject to the boundary condition of first kind over a square domain. An important feature of our method is that it uses only 9-grid points and discretize the boundary condition without use of fictitious point. The first order derivative of solution is obtained as a byproduct of the method. Method is successfully applied to solve singular linear equation. The method is used to solve a set of model test problem. Numerical solutions are included to demonstrate computational potency and the order of the method.
Computational steering of a multi-objective evolutionary algorithm for engineering design
Authors: Alex Shenfield, Peter J. Fleming, Muhammad Alkarouri
Venue: Engineering Applications of Artificial Intelligence (2007)

The execution process of an evolutionary algorithm typically involves some trial and error. This is due to the difficulty in setting the initial parameters of the algorithm-especially when little is known about the problem domain. This problem is magnified when applied to many-objective optimisation, as care is needed to ensure that the final population of candidate solutions is representative of the trade-off surface. We propose a computational steering system that allows the engineer to interact with the optimisation routine during execution. This interaction can be as simple as monitoring the values of some parameters during the execution process, or could involve altering those parameters to influence the quality of the solutions produced by the optimisation process. The implementation of this steering system should provide the ability to tailor the client to the hardware available, for example providing a lightweight steering and visualisation client for use on a PDA.
New Design Approach of Robust H 8 Control for Uncertain Fuzzy Markovian Jump Systems
Authors: Jun Chen, Fei Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper is concerned with the problem of robust H control for a class of uncertain nonlinear Markovian jump systems described by the Takagi-Sugeno (T-S) fuzzy mod- els. The aim is to find a mode-dependent state feedback controller such that the closed-loop fuzzy jump system is robustly stochastically stable and a prescribed H perfor- mance level is satisfied for all admissible uncertainties. By introducing two free matrix variables, a new sufficient con- dition for the existence of such a controller is derived in terms of linear matrix inequalities (LMIs). The last numer- ical example is provided to illustrate the effectiveness of the developed results.
On extracting information implied in options
Authors: M. Benko, M. Fengler, W. Härdle, M. Kopa
Venue: Computational Statistics (2007)

Options are financial instruments with a payoff depending on future states of the underlying asset. Therefore option markets contain information about expectations of the market participants about market conditions, e.g. current uncertainty on the market and corresponding risk. A standard measure of risk calculated from plain vanilla options is the implied volatility (IV). IV can be understood as an estimate of the volatility of returns in future period. Another concept based on the option markets is the state-price density (SPD) that is a density of the future states of the underlying asset. From raw data we can recover the IV function by nonparametric smoothing methods. Smoothed IV estimated by standard techniques may lead to a non-positive SPD which violates no arbitrage criteria. In this paper, we combine the IV smoothing with SPD estimation in order to correct these problems. We propose to use the local polynomial smoothing technique. The elegance of this approach is that it yields all quantities needed to calculate the corresponding SPD. Our approach operates only on the IVs--a major improvement comparing to the earlier multi-step approaches moving through the Black---Scholes formula from the prices to IVs and vice-versa.