ppxscal/embedding_network huggingface dataset:
Model-Based Software Design and Adaptation
Authors: Hassan Gomaa, Mohamed Hussein
Venue: Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems (2007)

This paper describes a modeling approach to software design and adaptation, in particular the design of evolutionary and dynamically reconfigurable software architectures. The different versions of an evolutionary system are considered a software product line, with each version of the system a product line member. After implementation, the model co-exists with the system and evolves with it. The software architecture is built out of architectural patterns. For each software architectural pattern, there is a corresponding software reconfiguration pattern, which describes how the software architecture can be dynamically adapted.
MULTI: multiple user interactive template installation
Authors: Nancy Paterson
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

To develop a software tool which simulates the experience of synesthesia to produce concrete, documentable expressions of creativity. A constitutive relationship between synesthesia and creativity (Campen, 2002) and an operational relationship between synesthesia and multimedia (Cytowic, 1993) has been suggested and following these leads, we propose to mobilize synesthesia as the visualization technique we will target to investigate the collaborative development of creativity.
Tutorial T8A: Automated Application Engine Synthesis from C Algorithms
Authors: Vinod Kathail, Shail Aditya, Craig Gleason, Nagesh Chatekar
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Increasingly IC design is driven by integrated consumer devices, which rely on standard algorithms such as H.264, 802.11n, or JPEG2000. These standards allow room for innovative implementation that can result in differentiated products. The architect's dilemma is that a disproportionate amount of the design time and the cost is spent on the hardware implementation and verification and not on algorithmic innovation. Automatic Application Engine Synthesis (AES) enables the creation of complex application engines such as an H.264 encoder directly from untimed C algorithms. It enables the designer to explore multiple design alternatives with different performance, area and power profiles in a very short period of time. This tutorial will focus on the use of AES methodology to design application engines consisting of configurable processors, hardware accelerators and complex interconnect, from C algorithms. The emphasis will be on describing techniques for synthesizing good HW from C code, competitive with manual design, for complex, multi-block hardware accelerators with the associated bus/memory/stream interconnect, as well as the verification and system validation of the resulting RTL. These blocks are crucial components of application engines, and they provide orders-of-magnitude improvement in performance and power compared to running the equivalent functions in software. Each topic will be presented taking examples from real-life designs. We will also present users' experiences in building a complete design using this methodology.
A Process-Centric Approach for Coordinating Product Configuration Decisions
Authors: Marcilio Mendonca, Donald Cowan, Toacy Oliveira
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In product family approaches such as software product lines, product configuration is a key activity that deals with the constrained combination and parameterization of reusable core assets as a means to achieve correct product assembly. The configuration process is highly collaborative in which different players, each with a particular perspective on the product under development, interact and negotiate configuration decisions. In this scenario, conflicts commonly occur as each part attempts to promote its own interests. As a consequence, there is an urge for approaches to effectively coordinate configuration decisions. In this paper, we present a process-centric approach to collaborative product configuration. Our approach attempts to anticipate and solve decision conflicts by allowing decision makers to define priority schemes. Major configuration decision support issues are discussed and a novel algorithm to derive executable process models is introduced. Finally, an illustrated example is shown demonstrating the approach's feasibility.
X3D Multi-user Virtual Environment Platform for Collaborative Spatial Design
Authors: Ch. Bouras, Ch. Tegos, V. Triglianos, Th. Tsiatsos
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

It is well known that both space and the spatial organization play an important role in our work and learning environments as well as in everyday life. There is a definite need for many persons to design their space along with an expert and to preview it in order to test its functionality. Many times there is a need for the inhabitants and workers to collaborate in order to co-design their space from distance. Multi-user 3D virtual environments are a powerful form of collaborative telecommunication applications, enabling the users to share a common three dimensional space and interact with each other as well as with the environment surrounding them, in order to collaboratively solve problems or aid learning processes. This paper presents the work done for extending a multi-user virtual environments platform, to support collaborative spatial design applications. Furthermore, a usage scenario is presented concerning the collaborative design of a classroom for educational purposes.
Digital ink and interaction in the classroom
Authors: Richard J. Anderson
Venue:  (2006)

Lectures, where the instructor talks and students listen, are the dominant format for most university-level courses. Yet, even as educational research confirms the need for interaction and feedback as a way to improve student learning, current models of interaction limit both the amount and type of interaction that can take place during most lectures. We have investigated the role student devices can have in creating new communication channels between student and instructor---increasing both the number of students communicating with the instructor and the quality of that interaction. Specifically we have investigated the use of pen-based communication integrated with lecture slides. We have added a student submission facility to a Tablet PC-based presentation tool (Classroom Presenter), which allows both the collection of input from student devices and the sharing of student artifacts with the class on a public display. This dissertation presents my contributions to (1) the design of the student submissions system, (2) the pedagogy we have developed around using student contributions, and (3) a detailed analysis of a set of pilot deployments of the system in real classrooms.
Rapid prototyping of multi-DSP systems based on accurate performance estimation
Authors: B. Rinner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The development of parallel applications is tedious and more complex than a single-processor solution. We have developed PEPSY, a prototyping environment for multi-DSP systems, with the primary goal to automate the design and implementation of parallel DSP applications. Given an extended data flow graph of the DSP application and a description of the target multiprocessor system, PEPSY automatically maps and schedules the DSP application onto the multiprocessor system and generates complete code for each processor. PEPSY excels in an accurate performance estimation. The design goals of the parallel application can, therefore, be verified prior to its implementation. With PEPSY, parallelization of a DSP application onto various processors can be realized within minutes.
A modified Baum-Welch algorithm for hidden Markov models with multiple observation spaces
Authors: P. M. Baggenstoss
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper, a new algorithm based on the Baum-Welch algorithm for estimating the parameters of a hidden Markov model (HMM) is presented. It allows each state to be observed using a different set of features rather than relying on a common feature set. Each feature set is chosen to be a sufficient statistic for discrimination of the given state from a common "white-noise" state. Comparison of likelihood values is possible through the use of likelihood ratios. The new algorithm is the same in theory as the algorithm based on a common feature set, but without the necessity of estimating high-dimensional probability density functions (PDFs). A simulated data example is provided showing superior performance over the conventional HMM.
vBlades: optimized paravirtualization for the Itanium processor family
Authors: Daniel J. Magenheimer, Thomas W. Christian
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

Virtualization of an "uncooperative" architecture often has severe performance consequences. Paravirtualization has recently been suggested as a solution to performance issues, but it introduces unacceptable supportability problems. The HP Labs vBlades project has identified a novel hybrid approach - which we call optimized paravirtualization. We examine methods for both virtualizing and paravirtualizing the Itanium processor, and then demonstrate optimized paravirtualization to maximize performance while simultaneously minimizing supportability concerns.
Development of a Robust and Flexible Weblab Framework based on AJAX and Design Patterns
Authors: Ariadne A. Cruz, Fabio A. L. Gomes, Fabbryccio A. C. M. Cardoso, Ernesto B. Martin, Dalton S. Arantes
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The objective of this paper is to present a generic and extensible access framework architecture for WebLab integration. In this framework each WebLab becomes accessible by means of a preinstalled plug-in. This modular approach makes it possible to add, remove or modify a plug-in, and its corresponding WebLab, without framework recompilation.
Improved estimation of the frequency of a single sinusoid in noise using a new measurement model
Authors: S. Reisenfeld, Qong Wu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The problem of estimating the frequency of a single sinusoid in white Gaussian noise is addressed. Results in the literature are based on a model for the observed signal phase that was first proposed in Tretter (1985). A new model for the observed signal phase is proposed here that models the observed phase noise more accurately, especially for low signal-to-noise ratios (SNR). Two estimators are designed using these two measurement models, namely, the Kalman filter and the maximum likelihood estimator. Their mean square estimation error performances are then compared using simulations, and it is shown that the estimators based on the new measurement model perform better at low SNR. The Kalman filter makes use of prior statistical knowledge of the signal and noise models, and thus is able to achieve a lower threshold SNR. In particular, the Kalman filter based on the new measurement model has the lowest threshold SNR.
SC-CFS: smartcard secured cryptographic file system
Authors: Naomaru Itoi
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

Storing information securely is one of the most important roles expected for computer systems, but it is difficult to achieve with current commodity computers. The computers may yield secrets through physical breach, software bug exploitation, or password guessing attack. Even file systems that provide strong security, such as the cryptographic file system, are not perfect against these attacks. We have developed SC-CFS, a file system that encrypts files and takes advantage of a smartcard for per-file key generation. SC-CFS counters password guessing attack, and minimizes the damage caused by physical attack and bug exploitation. The performance of the system is not yet satisfactory, taking 300 ms for accessing a file.
MPS Model and TABA Workstation: Implementing Software Process Improvement Initiatives in Small Settings
Authors: Mariano Montoni, Gleison Santos, Ana Regina Rocha, Kival C. Weber, Eratostenes E. R. de Araujo
Venue: Proceedings of the 5th International Workshop on Software Quality (2007)

Small and Medium-size Enterprises (SME) are usually hindered from improving their processes due to the complexity and costs involved in Software Process Improvement (SPI). In this context, Brazilian software industries and research universities are working cooperatively to implement a strategy aiming to improve software processes of Brazilian SME. The main goal of this initiative is to develop and disseminate a Brazilian software process model (named MPS Model) aligned to Brazilian software industry realities. In order to cope with factors that have influence on SPI success, we developed an approach to implement MPS Model-based initiatives through the support of a Process-centered Software Engineering Environment named TABA Workstation. This paper presents the MPS Model components and the main functionalities of the TABA Workstation to support MPS Model-based implementations in SME. We also discuss the achieved results of Brazilian SME that adopted the presented approach.
A constraint handling approach for the differential evolution algorithm
Authors: J. Lampinen
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

An extension for the differential evolution algorithm is proposed for handling nonlinear constraint functions. In comparison with the original algorithm, only the replacement criterion was modified for handling the constraints. In this article the proposed method is described and demonstrated by solving a suite of ten well-known test problems.
Preconditioners for regularized image superresolution
Authors: N. Nguyan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Superresolution reconstruction produces a high resolution image from a set of low resolution images. Previous work on superresolution had not adequately addressed the computational issues for this problem. In this paper, we propose efficient block circulant preconditioners for solving the regularized superresolution problem by conjugate gradients. The effectiveness of the preconditioners is demonstrated with superresolution results for a simulated image sequence and a FLIR image sequence.
Comparison of wafer-level spatial I/sub DDQ/ estimation methods: NNR versus NCR
Authors: S. S. Sabade, D. M. H. Walker
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

Extending the useful life of I/sub DDQ/ test to deep submicron technologies has been a topic of interest in recent years. I/sub DDQ/ test loses its effectiveness as the signal to noise ratio degrades due to rising background current and fault-free I/sub DDQ/ variance. Defect detection using I/sub DDQ/ test requires separation of deterministic sources of variation from defective current. Several methods that use deterministic variation in I/sub DDQ/ at the wafer level for estimating fault-free I/sub DDQ/ of a chip are proposed. This paper compares two such methods: nearest neighbor residual (NNR) and neighbor current ratio (NCR). These methods are evaluated using industrial test data for a recent technology.
Diploid genome reconstruction from shotgun sequencing
Authors: Michael S. Waterman
Venue:  (2006)

In genome sequencing projects, the objective has been to determine a haploid consensus sequence. Although polymorphisms were identified from a eukaryotic genome, haplotypes have not been inferred directly. In this article, we propose a statistical method to detect polymorphisms in genome sequencing projects and infer haplotypes from the polymorphisms. First, assuming that polymorphic sites are given, we describe a probabilistic model which incorporates sequence error rates, composition probability of each base, and memberships of fragments. We provide a statistical method to calculate probabilities of different haplotype configurations from the assembly. To reduce computation complexity, the most likely haplotypes are calculated from adjacent polymorphisms, and then those haplotypes are linked to form longer haplotypes. We show the simulation results based on this method. Next, we develop a fast algorithm to score the confidence of estimated haplotypes. The complexity of the algorithm is linear with respect to the number of polymorphisms. We utilize this scoring method to increase the quality of estimated haplotypes. To assemble the Ciona intestinalis genome, we propose a novel approach, which uses the Gibbs sampler simultaneously with polymorphism detection strategy. Ciona intestinalis is known for its high polymorphism rate which is reported to be 1.2% (Dehal et al. [21]). Here, we remove the restriction that polymorphic sites are given. We report the polymorphism rate of Ciona intestinalis by using our method. Also, simulation results are shown to evaluate the accuracy of our method.
Analysis and Classification of Multi-Criteria Recommender Systems
Authors: Nikos Manouselis, Constantina Costopoulou
Venue: World Wide Web (2007)

Recent studies have indicated that the application of Multi-Criteria Decision Making (MCDM) methods in recommender systems has yet to be systematically explored. This observation partially contradicts with the fact that in related literature, there exist several contributions describing recommender systems that engage some MCDM method. Such systems, which we refer to as multi-criteria recommender systems, have early demonstrated the potential of applying MCDM methods to facilitate recommendation, in numerous application domains. On the other hand, a comprehensive analysis of existing systems would facilitate their understanding and development. Towards this direction, this paper identifies a set of dimensions that distinguish, describe and categorize multi-criteria recommender systems, based on existing taxonomies and categorizations. These dimensions are integrated into an overall framework that is used for the analysis and classification of a sample of existing multi-criteria recommender systems. The results provide a comprehensive overview of the ways current multi-criteria recommender systems support the decision of online users.
Terminal backup, 3D matching, and covering cubic graphs
Authors: Elliot Anshelevich, Adriana Karagiozova
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We define a problem called Simplex Matching, and show that it is solvable in polynomial time. While Simplex Matching is interesting in its own right as a nontrivial extension of non-bipartite min-cost matching, its main value lies in many(seemingly very different) problems that can be solved using ouralgorithm. For example, suppose that we are given a graph with terminal nodes, non-terminal nodes, and edge costs. Then, the Terminal Backup problem, which consists of finding the cheapest forest connecting every terminal to at least one other terminal, is reducible to Simplex Matching. Simplex Matching is also useful for various tasks that involve forming groups of at least two members, such as project assignment and variants of facility location. In an instance of Simplex Matching, we are given a hypergraphH with edge costs, and edge size at most 3. We show how to find the min-cost perfect matching of H efficiently, if the edge costs obey a simple and realistic inequality that we call the SimplexCondition. The algorithm we provide is relatively simple to understand and implement, but difficult to prove correct. In the process of this proof we show some powerful new results about covering cubic graphs with simple combinatorial objects.
Competing in the Era of Emergent Architecture: The Case of Packaged Software Industry
Authors: Bala Iyer, Chi-Hyon Lee, David Dreyfus
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The firms that comprise the prepackaged software industry form a complex system engaged in systems-based competition. This complex system survives and grows because it follows emergent design principles notably articulated by Herbert Simon. In particular, complex systems form stable subsystems -- clusters -- that can be described (in this industry) as a stack. In this research, we study the evolution of the software industry using data on packaged software development firms over 13 years (1990-2002) across functional markets. We show that by exploiting complementarities based on the emergent architecture, firms can outperform competitors that use complementarities that are based on the espoused architecture/stack, which outperform those that ignore architecture altogether.
Graphical study of signals and systems
Authors: E. Sayrol
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We present a simulation software devoted to the practical study of analog signals and systems. The program exhaustively exploits the graphical tools provided by MATLAB to obtain a user-friendly environment. It can be used as a self-instruction teaching material. On the other hand it contains a complete and very large set of graphic exercises that makes it unique. Some examples of the possibilities and features of the developed software are shown.
Sensor Networks + Grid Computing = A New Challenge for the Grid?
Authors: Geoff Coulson, Dean Kuo, John Brooke
Venue: IEEE Distributed Systems Online (2006)

A new class of distributed applications, pervasive management support systems, combine sensor network and Grid technologies to support the ongoing management of evolving physical systems. Essentially, PMS systems marry reality and simulation and support sophisticated what-if analysis to help people make faster and better real-world decisions.
Adaptive subarray design for interference cancellation
Authors: Ho Yang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A method for designing near-optimal, tapered subarrays for adaptive interference cancellation is proposed. The limited aperture or limited element feature of these subarrays enables a low-complexity hardware implementation of a partially adaptive array. This approach optimizes canceller performance for a given number of beams and a given number of elements per beams.
Scaling, Power and the Future of CMOS
Authors: Mark Horowitz
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In the mid 1980's the power growth that accompanied scaling forced the industry to focus on CMOS technology, and leave nMOS and bipolars for niche applications. Now 20 years later, CMOS technology is facing power issues of its own. After first reviewing the "cause of the problem, it will become clear that there are not easy solutions this time no new technology or simple system/circuit change will rescue us. Power, and not number of devices is now the primary limiter of chip performance, and the need to create power efficient designs is changing how we do design. This talk will review power optimized design methods and shows how power is strongly tied to performance and that variability aversely effects power efficiency. Projecting forward, it shows that unless die size shrinks, in future technologies most of the devices will need to be idle most of the time which has strong ramifications for the both the underlying device and system design.