ppxscal/embedding_network huggingface dataset:
Software Quality Attribute Analysis by Architecture Reconstruction (SQUA3RE)
Authors: Christoph Stormer
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software Quality Attribute Analysis by Architecture Reconstruction (SQUA3RE) is a method that fosters a goal-driven process to evaluate the impact of what-if scenarios on existing systems. The method is partitioned into SQA2 and ARE. The SQA2 part provides the analysis models that can be used for quality attribute impact scenarios. ARE provides the necessary information from a reconstruction perspective in order to create and feed the SQA^2 part.
A low-SER efficient core processor architecture for future technologies
Authors: E. L. Rhod, C. A. Lisbôa, L. Carro
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Device scaling in new and future technologies brings along severe increase in the soft error rate of circuits, for combinational and sequential logic. Although potential solutions have started to be investigated by the community, the full use of future resources in circuits tolerant to SETs, without performance, area or power penalties, is still an open research issue. This paper introduces MemProc, an embedded core processor with extra low SER sensitivity, and with no performance or area penalty when compared to its RISC counterpart. Central to the SER reduction are the use of new magnetic memories (MRAM and FRAM) and the minimization of the combinational logic area in the core. This paper shows the results of fault injection in the MemProc core processor and in a RISC machine, and compares performance and area of both approaches. Experimental results show a 29 times increase in fault tolerance, with up to 3.75 times in performance gains and 14 times less sensible area.
Scalable event matching for overlapping subscriptions in pub/sub systems
Authors: Zhen Liu, Srinivasan Parthasarthy, Anand Ranganathan, Hao Yang
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of operators, such as comparison on primitive data types (string, integer, etc). In this paper, we consider a publish/subscribe system that supports more flexible events/subscriptions with the use of advanced, yet potentially expensive, matching operators. Examples of such operators are pattern recognizers on multimedia data and spatial operators on location data. We study a critical problem in these publish/subscribe systems, namely how to optimize the matching process for a large number of subscriptions. This is achieved by exploiting the overlap in the subscriptions and sharing the operator evaluation results whenever possible. We formulate the optimal subscription evaluation problem and show that it is NP-Hard. We propose an efficient d-approximation algorithm, where d is the maximum number of operators in one subscription, as well as a heuristic algorithm that can further improve the system performance in practice. Our experiment results show that the proposed algorithms can reduce the matching cost by up to 80%, as compared to a naive strategy that evaluates the subscriptions independently.
Local Graph Matching for Face Recognition
Authors: Ehsan Fazl Ersi, John S. Zelek
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

We represent face images by a set of triangular labeled graphs, each containing information on the appearance and geometry of a 3-tuple of face feature points. Our method automatically learns a model set and builds a graph space for each individual. A two-stage method for fast matching is developed, where in the first stage a Maximum a Posterior solution based on PCA factorization is used to efficiently prune the search space and select very few candidate model sets, and in the second stage a nearest neighborhood classifier is used to find the closest model graphs to the query image graphs. Finally, the probe image is assigned to the trained individual with the maximum number of references. Our proposed technique achieves perfect results on the ORL face set and an accuracy rate of 97.7% on the FERET face set, which shows the superiority of the proposed technique over all considered state-of-the-art methods (Elastic Bunch Graph Matching, LDA+PCA, Bayesian Intra/Extra-personal Classifier, Boosted Haar Classifier).
Teaching computer architecture/organisation using simulators
Authors: H. Grunbacher
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Experience shows that many students, especially those with little hardware background, encounter difficulties in understanding the consequences and even concepts of conventional instruction pipelining; superscalar instruction processing is even more complicated and harder to understand. It is particularly difficult to statically teach the concept of a pipeline. Therefore we developed software to simulate and dynamically visualize the processing of instructions by pipelined (superscalar) processors. Three simulators have been developed: WinDLX is based on Hennessy/Pattersons DLX architecture and is modeled at the architecture level, therefore very little processor-internal information is given. MIPSim is based on Patterson/Hennessy's MIPS processor book and is modeled at the computer organization level, functional units like register file, pipeline registers, multiplexers are visible and MIPSim displays content and dynamic behavior of such units. M10kSim is based on the MIPS R10000 architecture and models the instruction decode and dispatch unit, the branch unit, the instruction queues and the functional units. Concepts like register renaming, branch history table, branch resume buffer, out of order execution can be explained easily using the simulator. Teaching cache organization is an easier task, nevertheless visualising cache activities helps understanding the dynamics of a cache memory, Xcache is a simulator which displays the interactions between instruction memory and instruction cache, data memory and data cache, respectively.
Modeling the Environment in Software-Intensive Systems
Authors: Carlo A. Furia, Matteo Rossi, Dino Mandrioli
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

In this paper we argue that the modeling activity in the development of software-intensive systems should formalize as much as possible of the environment in which the application being developed operates. We also show that a rich formal model of the environment helps developers clearly state requirements that might typically be considered intrinsically informal (or nonformalizable in general). To illustrate this point, we show how a requirement for "orderly safe traffic" in a traffic system can be modeled, and we briefly discuss the benefits thereof.
A Pattern System for Security Requirements Engineering
Authors: Denis Hatebur, Maritta Heisel, Holger Schmidt
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We present a pattern system for security requirements engineering, consisting of security problem frames and concretized security problem frames. These are special kinds of problem frames that serve to structure, characterize, analyze, and finally solve software development problems in the area of software and system security. We equip each frame with formal preconditions and postconditions. The analysis of these conditions results in a pattern system that explicitly shows the dependencies between the different frames. Moreover, we indicate related frames, which are commonly used together with the considered frame. Hence, our approach helps security engineers to avoid omissions and to cover all security requirements that are relevant for a given problem.
Dynamic design and evaluation of software architecture in critical systems development
Authors: Klaus Marius Hansen, Lisa Wells
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

The software architecture of a computing system is an abstracted structure of the system in terms of elements and relationships. Such structures may be viewed from a number of viewpoints including static/module, dynamic/execution, and deployment viewpoints. Software architecture fundamentally influences systems from all of these viewpoints and designing and implementing proper software architectures is thus critical in many problem domain areas, including the ones that pertain to safety-critical systems. With respect to safety-critical systems, a particular problem with focusing on software architecture is that there may be a large abstraction gap between an architectural description and an executing system or a formal model thereof thus potentially leading to inconsistencies between models and implementation. Addressing this problem, this paper presents tools and techniques for specifying executable software architectures and for validating these with formal models such as statecharts and Petri nets.
Face recognition by fractal transformations
Authors: T. Tan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

In this paper, we propose a new method for computerized human face recognition using fractal transformations. We show that by utilizing the intrinsic properties of block-wise self-similar transformations in fractal image coding we can use it to perform face recognition. The contractivity factor and the encoding scheme of the fractal encoder are shown to affect recognition rates. Using this method, an average error rate of 1.75% was obtained on the ORL face database.
A DSP-based DS/CDMA modem for multimedia applications over geo-stationary satellite networks
Authors: C. Sacchi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Multimedia services over satellite networks require a large amount of bandwidth for the delivery of variable-bit-rate video and audio signal with adequate quality of service. Hence, the bandwidth allocation has to be efficiently managed. In such a case, CDMA is a flexible multiple access technique since it allows a dynamic configuration of the resources allotted to the users of the system. This paper aims at describing a DSP-based DS/CDMA satellite multimedia system for multimedia applications, working in geo-stationary (GEO) satellite networks. The DSP implementation of the satellite modem is described in detail, both for what concerns the hardware section and the signal processing algorithmic section. The developed prototype, whose test is expected during year 2001, should be considered as a basic platform for developing flexible software radio-based architectures for satellite communications.
Interactions between a Mobile Virtual Network Operator and External Networks with Regard to Service Triggering
Authors: Marc Cheboldaeff
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Traditional mobile operators invested huge amounts of money in the 1990s to build the current 2G wireless networks, like GSM networks in Europe. Those networks have proven to be stable. In most cases, their capacity has not yet been exhausted. Furthermore, the marketing departments of mobile operators now consider the commercial possibility of selling mobile subscriptions through new channels, like supermarkets. The concept of Mobile Virtual Network Operator (MVNO) arose. Some of them are just new brands and do not own any telecommunications equipment. Other companies do own part of the network: these are the Mobile Virtual Network Enablers (MVNE). They provide part of the network infrastructure, while the MVNO serve end-customers. When it comes to service triggering, the interaction between the MVNE and the traditional mobile operator, called in this present study the host network, and with visited networks becomes a critical issue, which we shall consider in this paper based on an actual implementation example.
Segmentation of Ovarian Ultrasound Images Using Single Template Cellular Neural Networks Trained with Support Vector Machines
Authors: Mitja Lenic, Damjan Zazula, Boris Cigale
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Various applications of cellular neural networks (CNNs) on complex image processing tasks raise questions about an appropriate selection of template elements that determine the CNN's behavior. In previous research we utilized multiple time variant template elements cellular neural networks for segmentation, which has many advantages compared to conventional search space approaches. In this paper a novel approach which utilizes the formalism of support vector machines (SVMs) that utilizes only single time invariant set of CNN template elements, is introduced. The main advantage of this approach is reduction of the number of CNNs templates and confirms to the conventional applications of CNN.
Using Economics as Basis for Modelling and Evaluating Software Quality
Authors: Stefan Wagner
Venue: Proceedings of the First International Workshop on The Economics of Software and Computation (2007)

The economics and cost of software quality have been discussed in software engineering for decades now. There is clearly a relationship and a need to manage cost and quality in combination. Moreover, economics should be the basis of any quality analysis. However, this implies several issues that have not been addressed to an extent so that managing the economics of software quality is common practice. This paper discusses these issues, possible solutions, and research directions.
FieldVis: A Tool for Visualizing Astrophysical Magnetohydrodynamic Flow
Authors: Blayne Field, Sean O'Neill, Victoria Interrante, Thomas W. Jones, Timothy Urness
Venue: IEEE Computer Graphics and Applications (2007)

Galaxy clusters are the largest gravitationally bound structures in the universe, and their properties have been suggested to hold essential clues to the history of the universe's formation. Hot gas fills these clusters (in accumulation being more massive than the galaxies themselves), and astronomers use the gas's thermodynamic properties to analyze the clusters' histories. The enormous power of the fast, collimated jets of ionized matter, or plasma, formed near massive black holes at the centers of distant galaxies seriously complicates this analysis. What is not theoretically resolved is precisely how and where the jets do their work, and just how efficiently they do it. To accomplish the complex visualization of these jets, the authors developed FieldVis, a simulation tool that focuses primarily on representing 3D vector and scalar fields. Examining data from a sample 3D magnetohydrodynamic fluid simulation graphically illustrates the usefulness of their visualization package.
Harmonic analysis associated with spatio-temporal transformations
Authors: J.-P. Leduc
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

The paper presents new developments in harmonic analysis associated with the motion transformations embedded in digital signals. In this context, harmonic analysis provides motion analysis with a complete theoretical construction of perfectly matching concepts and a related toolbox leading to fast algorithms. This theory can be built from only two assumptions: an associative structure for the local motion transformations expressed as Lie group and a principle of optimality for the global evolution expressed as a variational extremal. Motion analysis means not only detection, estimation, interpolation, and tracking but also propagators motion-compensated filtering, signal decomposition, and selective reconstruction. The optimality principle defines the trajectory and provides the appropriate equations of motion, the selective tracking equations, the selective constants of motion to be tracked, and all the symmetries to be imposed on the system. The harmonic analysis provides new special functions, orthogonal bases, PDEs, ODEs and integral equations. The tools to be developed rely on group representations, continuous and discrete wavelets, the estimation theory (prediction, smoothing and interpolation) and filtering theory (Kalman filters, motion-based convolutions, integral transforms). All the algorithms are supported by fast and parallelizable implementations based on the FFT and dynamic programming.
Animation in a peripheral display: distraction, appeal, and information conveyance in varying display configurations
Authors: Christopher Plaue, John Stasko
Venue: Proceedings of Graphics Interface 2007 (2007)

Peripheral displays provide secondary awareness of news and information to people. When such displays are static, the amount of information that can be presented is limited and the display may become boring or routine over time. Adding animation to peripheral displays can allow them to show more information and can potentially enhance visual interest and appeal, but it may also make the display very distracting. Is it possible to employ animation for visual benefit without increasing distraction? We have created a peripheral display system called BlueGoo that visualizes R.S.S. news feeds as animated photographic collages. We present an empirical study in which participants did not find the system to be distracting, and many found it to be appealing. The study also explored how different display sizes and positions affect information conveyance and distraction. Animations on an angled second monitor appeared to be more distracting than three other configurations.
Static analysis of executables to detect malicious patterns
Authors: Mihai Christodorescu, Somesh Jha
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Malicious code detection is a crucial component of any defense mechanism. In this paper, we present a unique viewpoint on malicious code detection. We regard malicious code detection as an obfuscation-deobfuscation game between malicious code writers and researchers working on malicious code detection. Malicious code writers attempt to obfuscate the malicious code to subvert the malicious code detectors, such as anti-virus software. We tested the resilience of three commercial virus scanners against code-obfuscation attacks. The results were surprising: the three commercial virus scanners could be subverted by very simple obfuscation transformations! We present an architecture for detecting malicious patterns in executables that is resilient to common obfuscation transformations. Experimental results demonstrate the efficacy of our prototype tool, SAFE (a static analyzer for executables).
On the effectiveness of distributed worm monitoring
Authors: Moheeb Abu Rajab, Fabian Monrose, Andreas Terzis
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

Distributed monitoring of unused portions of the IP address space holds the promise of providing early and accurate detection of high-profile security events, especially Internet worms. While this observation has been accepted for some time now, a systematic analysis of the requirements for building an effective distributed monitoring infrastructure is still missing. In this paper, we attempt to quantify the benefits of distributed monitoring and evaluate the practicality of this approach. To do so we developed a new worm propagation model that relaxes earlier assumptions regarding the uniformity of the underlying vulnerable population. This model allows us to evaluate how the size of the monitored address space, as well the number and locations of monitors, impact worm detection time. We empirically evaluate the effect of these parameters using traffic traces from over 1.5 billion suspicious connection attempts observed by more than 1600 intrusion detection systems dispersed across the Internet. Our results show that distributed monitors with half the allocated space of a centralized monitor can detect non-uniform scanning worms in half the time. Moreover, a distributed monitor of the same size as a centralized monitor can detect the worm four times faster. Furthermore, we show that even partial knowledge of the vulnerable population density can be used to improve monitor placement. Exploiting information about the location of the vulnerable population leads, in some cases, to detection time that is seven times as fast compared to random monitor deployment.
Utilizing Dynamically Coupled Cores to Form a Resilient Chip Multiprocessor
Authors: Christopher LaFrieda, Engin Ipek, Jose F. Martinez, Rajit Manohar
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Aggressive CMOS scaling will make future chip multiprocessors (CMPs) increasingly susceptible to transient faults, hard errors, manufacturing defects, and process variations. Existing fault-tolerant CMP proposals that implement dual modular redundancy (DMR) do so by statically binding pairs of adjacent cores via dedicated communication channels and buffers. This can result in unnecessary power and performance losses in cases where one core is defective (in which case the entire DMR pair must be disabled), or when cores exhibit different frequency/leakage characteristics due to process variations (in which case the pair runs at the speed of the slowest core). Static DMR also hinders power density/ thermal management, as DMR pairs running code with similar power/thermal characteristics are necessarily placed next to each other on the die. We present dynamic core coupling (DCC), an architectural technique that allows arbitrary CMP cores to verify each other's execution while requiring no static core binding at design time or dedicated communication hardware. Our evaluation shows that the performance overhead of DCC over a CMP without fault tolerance is 3% on SPEC2000 benchmarks, and is within 5% for a set of scalable parallel scientific and data mining applications with up to eight threads (16 processors). Our results also show that DCC has the potential to significantly outperform existing static DMR schemes.
A taxonomy for denial of service attacks in content-based publish/subscribe systems
Authors: Alex Wun, Alex Cheung, Hans-Arno Jacobsen
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Denial of Service (DoS) attacks continue to affect the availability of critical systems on the Internet. The existing DoS problem is enough to merit significant research dedicated to analyzing and classifying DoS attacks in the Internet context. However, no such research exists for DoS attacks in the domain of Content-based Publish/Subscribe (CPS) systems despite CPS being at the forefront of business process execution, application integration, and event processing applications. This can be attributed to the lack of structure and understanding of key issues in the area of DoS in CPS systems. In this paper, we propose to address these problems by presenting a taxonomy for classifying DoS characteristics and concerns new to CPS systems. Our taxonomy is motivated by a number of experimental results that were obtained using our CPS middleware implementation and that highlight fundamental DoS concerns in this domain. Finally, we discuss some example DoS attacks in detail with respect to our taxonomy and experimental results. We find that localization, message content complexity, and filter statefulness are the key CPS characteristics to consider when designing DoS resilient CPS systems.