ppxscal/embedding_network huggingface dataset:
Towards Automated Restructuring of Object Oriented Systems
Authors: Adrian Trifu, Urs Reupke
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software aging is an important cost contributor to the maintenance of aging software systems. Recent years have brought significant progress in the area of automatic detection of "code smells" as well as tool support for refactoring and implementing design patterns in the code. Nonetheless, there is hardly any tool support to help the maintainer decide how to refactor in a given situation, such that the recommended refactorings are also meaningful in that particular situation. Most of the existing techniques are either merely supporting the process, such as visualizations, or cannot guarantee meaningful refactorings, such as optimization based techniques. This paper introduces and experimentally evaluates a novel, tool supported approach to determine meaningful refactorings to structural flaws in object oriented systems. The refactorings recommended by our approach are guaranteed to lead to a meaningful and more maintainable structure in each analyzed situation. The approach contributes to a dramatic reduction of costs, by reducing the need and scope of detailed, manual code analysis.
Refactoring--Does It Improve Software Quality?
Authors: Konstantinos Stroggylos, Diomidis Spinellis
Venue: Proceedings of the 5th International Workshop on Software Quality (2007)

Software systems undergo modifications, improvements and enhancements to cope with evolving requirements. This maintenance can cause their quality to decrease. Various metrics can be used to evaluate the way the quality is affected. Refactoring is one of the most important and commonly used techniques of transforming a piece of software in order to improve its quality. However, although it would be expected that the increase in quality achieved via refactoring is reflected in the various metrics, measurements on real life systems indicate the opposite. We analyzed source code version control system logs of popular open source software systems to detect changes marked as refactorings and examine how the software metrics are affected by this process, in order to evaluate whether refactoring is effectively used as a means to improve software quality within the open source community.
A Framework for Roles for Development, Evolution and Maintenance of SOA-Based Systems
Authors: Mira Kajko-Mattsson, Grace A. Lewis, Dennis B. Smith
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Development, evolution and maintenance of SOAbased systems demands rethinking of the traditional roles for performing these activities. The key objective of this paper is to present preliminary ideas on the roles required for developing, evolving and maintaining SOA-based systems and to suggest a framework for areas of needed research.
Efficient processing of pathological images using the grid: computer-aided prognosis of neuroblastoma
Authors: Berkant Barla Cambazoglu, Olcay Sertel, Jun Kong, Joel Saltz, Metin N. Gurcan, Umit V. Catalyurek
Venue: Proceedings of the 5th IEEE workshop on Challenges of large applications in distributed environments (2007)

This paper presents a generalizable architecture for a grid-enabled biomedical imaging application, used for processing of pathological images for computer-aided prognosis. The presented architecture provides the scientists and developers a collaborative environment for management of remote image data and algorithm repositories and job execution over the grid. It is specifically designed for processing large-scale images in a distributed environment. In addition to the architecture, we also present its application to the computer-aided neuroblastoma prognosis as well as performance evaluation of the developed system using digitized pathological images.
Delaunay Meshing of Isosurfaces
Authors: Tamal K. Dey, Joshua A. Levine
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

We present an isosurface meshing algorithm, DELISO, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guarantees for topology, geometry, mesh gradedness, and triangle shape. A restricted Delaunay tri- angulation, dual of the intersection between the surface and the three dimensional Voronoi diagram, is often the main ingredient in Delaunay refinement. Computing and storing three dimensional Voronoi/Delaunay diagrams become bot- tlenecks for Delaunay refinement techniques since isosur- face computations generally have large input datasets and output meshes. A highlight of our algorithm is that we find a simple way to recover the restricted Delaunay triangula- tion of the surface without computing the full 3D structure. We employ techniques for efficient ray tracing of isosurfaces to generate surface sample points, and demonstrate the ef- fectiveness of our implementation using a variety of volume datasets.
Queuing analysis and performance evaluation of workflow through WFQN
Authors: Yunni Xia, Hanpin Wang, Yu Huang, Wanling Qu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Performance prediction is one of the most important research topics of workflow. To investigate the performance of workflow systems in queuing condition, this paper extends traditional WF-net into WFQN (WF queuing network), by modeling tasks as FIFS (first-in-first-service) queues and the source place as the input of tokens following poisson arrival process. Analytical methods are introduced to evaluate the queue-length, wait-time and completion-duration. The case study (especially the case of airline ticket booking application) shows that WFQN can model real-world workflow-based applications effectively. Through Montecarlo simulations in the case study, we show analytical models are verified by simulative results. We also present a sensitivity analysis technique to identify performance bottle-necks of WFQN. This paper concludes with a comparison with relate work.
A method for cartoon-style rendering of liquid animations
Authors: Ashley M. Eden, Adam W. Bargteil, Tolga G. Goktekin, Sarah Beth Eisinger, James F. O'Brien
Venue: Proceedings of Graphics Interface 2007 (2007)

In this paper we present a visually compelling and informative cartoon rendering style for liquid animations. Our style is inspired by animations such as Futurama,1 The Little Mermaid,2 and Bambi2. We take as input a liquid surface obtained from a three-dimensional physically based liquid simulation system and output animations that evoke a cartoon style and convey liquid movement. Our method is based on four cues that emphasize properties of the liquid's shape and motion. We use bold outlines to emphasize depth discontinuities, patches of constant color to highlight near-silhouettes and areas of thinness, and, optionally place temporally coherent oriented textures on the liquid surface to help convey motion.
On Visualization of Cocitation Networks
Authors: Tsung Teng Chen, Liang Chi Hsieh
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

The visualization of a cocitation network is a useful technique for information scientists. The technique will help to illustrate the intellectual structure of a given knowledge domain. We hope our results will improve on current tools with regard to user interface interactivity and scale better for larger data sets. We developed a tool, with the visualizing cocitation network in mind, by using an open-sourced toolkit for interactive information visualization to address some of these inadequacies. This tool exhibits cocitation graphs with latent visual cues and allows direct interaction with the visualized graphs. We demonstrated the visualized effects of this tool and complemented the results with its domain content analysis in a case study.
Knowledge Map: Toward a New Approach Supporting the Knowledge Management in Distributed Data Mining
Authors: Nhien-An Le-Khac, Lamine M. Aouad, M-Tahar Kechadi
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Distributed data mining (DDM) deals with the problem of finding patterns or models, called knowledge, in an environment with distributed data and computations. Today, a massive amounts of data which are often geographically distributed and owned by different organisation are being mined. As consequence, a large mount of knowledge are being produced. This causes problems of not only knowledge management but also visualization in data mining. Besides, the main aim of DDM is to exploit fully the benefit of distributed data analysis while minimising the communication. Existing DDM techniques perform partial analysis of local data at individual sites and then generate a global model by aggregating these local results. These two steps are not independent since naive approaches to local analysis may produce an incorrect and ambiguous global data model. The integrating and cooperating of these two steps need an effective knowledge management, concretely an efficient map of knowledge in order to take the advantage of mined knowledge to guide mining the data. In this paper, we present "knowledge map", a representation of knowledge about mined knowledge. This new approach aims to manage efficiently mined knowledge in large scale distributed platform such as Grid. This knowledge map is used to facilitate not only the visualization, evaluation of mining results but also the coordinating of local mining process and existing knowledge to increase the accuracy of final model.
Academic excellence by the Telemark Model of cooperative learning
Authors: T. Clausen
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Since 1982, the Engineering College of Hogskolen i Telemark, Norway, has practiced cooperative learning in groups through six semesters-the Telemark Model. It has been shown earlier that the Telemark Model has tended to stimulate academic diversity and personal growth, and that students at large feel quite comfortable with this way of learning. But "quite comfortable" signals at least one uncertainty: "Are we learning what we are expected to learn, as the project work is so time-consuming and, in addition, tend to replace so much of the useful curriculum they learn at other engineering schools?" the students ask. A recent comparison between a significant number of Telemark and other Norwegian Students at South Dakota School of Mines and Technology, USA, has shown that no evidence has been found to nourish the students' fear that the "correct curriculum" has been sacrificed on the altar of diversity and personal growth. 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
Writing CGI scripts in Tcl
Authors: Don Libes
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

CGI scripts enable dynamic generation of HTML pages. This paper describes how to write CGI scripts using Tcl. Many people use Tcl for this purpose already but in an ad hoc way and without realizing many of the more nonobvious benefits. This paper reviews these benefits and provides a framework and examples. Canonical solutions to HTML quoting problems are presented. This paper also discusses using Tcl for the generation of different formats from the same document. As an example, FAQ generation in both text and HTML are described.
Spectral modification for concatenative speech synthesis
Authors: J. Wouters
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Concatenative synthesis can produce high-quality speech but is limited to the allophonic variations and voice types that were captured in the database. It would be desirable to modify speech units to remove formant discontinuities and to create new speaking styles, such as hypo- or hyper-articulated speech. Unfortunately, manipulating the spectral structure often leads to degraded speech quality. We investigate two speech modification strategies, one based on inverse filtering and the other on sinusoidal modeling, and we explain their merits and shortcomings for changing the spectral envelope in speech. We then propose a method which uses sinusoidal modeling and represents the complex sinusoidal amplitudes by an all-pole model. The all-pole model approximates the sinusoidal spectrum well, both in the amplitude and in the phase domain. We use the sinusoidal+all-pole model to control the spectral envelope in recorded speech. High-quality modified speech is generated from the model using sinusoidal synthesis. A perceptual test was conducted, which shows that the model was effective at changing vowel identities and was preferable over residual excited LPC.
Adaptive local polynomial fourier transform in ISAR
Authors: Igor Djurović, Thayananthan Thayaparan, Ljubiša Stanković
Venue: EURASIP Journal on Applied Signal Processing (2006)

The adaptive local polynomial Fourier transform is employed for improvement of the ISAR images in complex reflector geometry cases, as well as in cases of fast maneuvering targets. It has been shown that this simple technique can produce significantly improved results with a relatively modest calculation burden. Two forms of the adaptive LPFT are proposed. Adaptive parameter in the first form is calculated for each radar chirp. Additional refinement is performed by using information from the adjacent chirps. The second technique is based on determination of the adaptive parameter for different parts of the radar image. Numerical analysis demonstrates accuracy of the proposed techniques.
A Multi-Agent-Based Architecture for Enterprise Customer and Supplier Cooperation Context-Aware Information Systems
Authors: Xiang Liu
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

The fast-growing and tremendous amount of enterprise customer and supplier documents has far exceeded the human ability for comprehension. A enterprise customer and supplier cooperation context-aware information system is powerful tools to process cooperating customer and supplier information. While there has been a variety of context middleware infrastructures and context-aware applications, little work has been done on integrating context-aware into enterprise customer and supplier cooperation information systems. In order to realize enterprise customer and supplier cooperation context-aware information systems that are on the one hand context -aware and on the other hand support enterprise customer and supplier cooperation electronic business. This paper proposes a multi-agent-based architecture for enterprise customer and supplier cooperation context-aware information systems which considers web service, multi-agent, data warehousing and OLAP interoperability compatible. A data warehousing that supports context-aware OLAP queries, use data cubes to store enterprise customer and supplier cooperation electronic business historical context data and to extract interesting knowledge from collections of enterprise customer and supplier cooperation electronic business context data, and to create new context from analysis of enterprise customer and supplier cooperation electronic business existing data. Finally, outline the implementation issue and conclusion and future research.
Emerging solutions technology and business views for the ubiquitous communication
Authors: Dr Heikki Huomo
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The presentation will cover a short historical overview of the ubiquitous communication research Dr Huomo was leading while at Nokia. This research program led to the development of the short range radio technology which is now known as Wibree and touch based service discovery technology now known as NFC. The current key use cases of the NFC and its future development directions will be covered. 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
Diagnostic Games, a Tool for Clinical Experience Formalization in Interactive "Physician--IT-specialist" Framework
Authors: Michael A. Shifrin, Olga B. Belousova, Eva I. Kasparova
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The specific characteristics of data processing in clinical decision problems require special approaches. This was the insight that made Izrail Gelfand and his colleagues look for new methods of formalization that would allow to discover the intrinsic structures in clinical data. A special technique for collaborative work of IT specialists and physicians named "diagnostic games" (DG) was developed for this purpose. This approach including the DG and related ideas of an "adequate language" and "structural units" is presented in this paper. The preliminary setting of clinical decision problem of surgical timing in patients with ruptured subarachnoid aneurysm is introduced as a subject for further formalization.
Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults
Authors: Martin Hutle, Andre Schiper
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Consensus is one of the key problems in fault tolerant distributed computing. A very popular model for solving consensus is the failure detector model defined by Chandra and Toueg. However, the failure detector model has limitations. The paper points out these limitations, and suggests instead a model based on communication predicates, called HO model. The advantage of the HO model over failure detectors is shown, and the implementation of the HO model is discussed in the context of a system that alternates between good periods and bad periods. Two definitions of a good period are considered. For both definitions, the HO model allows us to compute the duration of a good period for solving consensus. Specifically, the model allows us to quantify the difference between the required length of an initial good period and the length of a non initial good period.
A problem based learning approach for freshman engineering
Authors: J. J. Kellar
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The South Dakota School of Mines and Technology began a revision of the freshman engineering curriculum in 1997. Beginning with a pilot program of 25 students, the program is now required for virtually all first-year engineering students. The program, FC 2000, utilizes a project-based learning approach and features student teams to integrate material in general engineering, mathematics, science and English. Small projects (2-3 per semester) are designed to give students an exposure to engineering design in a variety of engineering disciplines. Project components include designing and conducting experiments, analyzing data, and presentation of technical data. We present a model for the first year curriculum, preliminary assessment results, and plans for future integration.
A Phase-Based Self-Tuning Algorithm for Reconfigurable Cache
Authors: Manman Peng, JiaGuang Sun, Yuming Wang
Venue: Proceedings of the First International Conference on the Digital Society (2007)

The performance of a given cache architecture is largely determined by the behavior of the application using the cache. Reconfigurable cache is an effective low-power technique. Using the technique, microprocessor's cache can be configured dynamically to adapt itself to the requirement of running program, and minimize the energy consumption and performance loss. We introduce a phase-based self-tuning algorithm (PBSTA), which can automatically, transparently, and dynamically manage the reconfigurable cache on a per-phase basis. In contrast with previous works, the algorithm seeks not only to lower the cache's energy consumption effectively, but also reduce the performance loss due to unnecessary reconfigurations. By simulating numerous MiBench benchmarks, the results show that the PBSTA, when applied to reconfigurable cache, saves on average 40% of total memory access energy compared with a conventional cache and the associated performance loss is close to 1.8%.
Adaptive branch and bound algorithm for selecting optimal features
Authors: Songyot Nakariyakul, David P. Casasent
Venue: Pattern Recognition Letters (2007)

We propose a new adaptive branch and bound algorithm for selecting the optimal subset of features in pattern recognition applications. The algorithm improves the search speed by avoiding unnecessary criterion function calculations at nodes in the solution tree. Our algorithm includes the following new properties: (i) ordering the tree nodes by the significance of features during construction of the tree, (ii) obtaining a large ''good'' initial bound by a floating search method, (iii) a new method to select an initial starting search level in the tree, and (iv) a new adaptive jump search strategy to select subsequent search levels to avoid redundant criterion function calculations. Our experimental results for four different databases demonstrate that our method is significantly faster than other versions of the branch and bound algorithm when the database has more than 30 features.
EPSO - best-of-two-worlds meta-heuristic applied to power system problems
Authors: V. Miranda, N. Fonseca
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents a new meta-heuristic (EPSO) built putting together the best features of evolution strategies (ES) and particle swarm optimization (PSO). Examples of the superiority of EPSO over classical PSO are reported. The paper also describes the application of EPSO to real world problems, including an application in opto-electronics and another in power systems.
A Novel Scheme for Encoding and Watermark Embedding in VLSI Physical Design for IP Protection
Authors: Debasri Saha, Parthasarathi Dasgupta, Susmita Sur-Kolay, Samar Sen-Sarma
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The emerging trend of design reuse in VLSI circuits poses the threat of theft and misappropriation of intellectual property (IP) of the design. Protection of design IP is a matter of prime concern today. Here we propose a scheme SECURE IP, which tackles the problem from an entirely new viewpoint. It relies on the application of cryptographic principles and the watermarking techniques to provide both direct and indirect IP protection in VLSI physical design. It makes unauthorized disclosure of a valuable design infeasible during its transmission, and can easily detect any alteration of the design file during transmission. The proposed scheme ensures authentication of the original designer as well as non-repudiation between the designer (seller) and the buyer. Illegal reselling can be efficiently detected by the proposed scheme. The algorithm SECURE IP is tested on random and MCNC benchmark instances, and the experimental results are quite encouraging.