ppxscal/embedding_network huggingface dataset:
Pattern-Driven Architectural Partitioning: Balancing Functional and Non-functional Requirements
Authors: Neil Harrison, Paris Avgeriou
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

One of the vexing challenges of software architecture is the problem of satisfying the functional specifications of the system to be created while at the same time meeting its non-functional needs. In this work we focus on the early stages of the software architecture process, when initial high-level system partitioning is being performed. Specifically, we study the problem of system partitioning with respect to both functional requirements and quality attributes. Architecture patterns are particularly well-suited to simultaneously addressing functional requirements and quality attributes. They support architects in considering both, understanding the impact of decisions on other attributes, and making tradeoffs among them. Existing architectural design methods accommodate pattern use, but do not exploit it in detail. We propose a pattern-based approach that leverages the benefits of patterns, and fits well with existing methods.
Global confidence regions in parametric shape estimation
Authors: J. F. Bohme
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We introduce confidence region techniques for analyzing and visualizing the performance of two-dimensional parametric shape estimators. Assuming an asymptotically normal and efficient estimator for a finite parameterization of the object boundary, Cramer-Rao bounds are used to define a confidence region, centered around the true boundary. Computation of the probability that an entire boundary estimate lies within the confidence region is a challenging problem, because the estimate is a two-dimensional nonstationary random process. We derive lower bounds on this probability using level crossing statistics. The results make it possible to generate confidence regions for arbitrary prescribed probabilities. These global confidence regions conveniently display the uncertainty in various geometric parameters such as shape, size, orientation, and position of the estimated object, and facilitate geometric inferences. Numerical simulations suggest that the new bounds are quite tight.
Channel optimized matrix quantization (COMQ) of LSP parameters over waveform channels
Authors: J. L. Perez-Cordoba
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Combined source and channel coding is a technique to mitigate channel errors without increasing the bit error rate. Channel optimized vector quantizer (COVQ) performs these objectives in the context of vector quantization. This paper presents a study of channel optimized matrix quantizer (COMQ) applied to quantize the line spectral pair (LSP) parameters as an extension of COVQ technique. Gaussian and slow-fading Rayleigh channels are considered and GMSK (Gaussian minimum shift-keying) is used as modulation technique. Several channel signal to noise ratio (CSNR) are considered to measure the performance of this system. In addition, for comparison purposes, the performance of other schemes for quantizing the LSP parameters are computed.
Hardware works, software doesn't: enforcing modularity with Mondriaan memory protection
Authors: Emmett Witchel, Krste Asanović
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Two big problems with operating systems written in unsafe languages are that they crash too often and that adding features becomes much more difficult over time. One cause of both of these problems is the lack of enforceable memory protection between module boundaries. Clear module boundaries make dependencies explicit, resulting in more reliable and maintainable code. Mondriaan Memory Protection (MMP) is a hardware/software design for fine-grained memory protection that can enforce module boundaries for systems written in unsafe languages. We present the design of an MMP-based modular operating system kernel and show how MMP can be used to provide module isolation while maintaining performance.
Optical properties of semiconductors [engineering education]
Authors: R. Martin
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

A computer based laboratory experiment in the physics lab for students of communications engineering, computer engineering and software engineering is described. The aim of the experiment is to bring the students at an early stage into practical contact to modern physics such as semiconductors, wave and quantum optics, and to gain a deeper understanding of the mechanisms of absorption and emission of light by semiconductors. The actual experiment is divided into three parts. After getting acquainted with the experimental set-up by calibrating the spectrometer the students measure the absorption coefficient in gallium phosphide and finally some emission spectra of different LEDs.
Modeling and Simulation Needs in Fusion Energy Research
Authors: Sandor Zoletnik
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Fusion energy research has reached a state, where a transition from laboratory scale physics experiments to industrial scale reactors is necessary and possible. Current devices can routinely reach plasma conditions needed for a fusion reactor, but positive energy balance can only be achieved by increasing the machine size by about a factor of two above the currently largest device JET. Although the step seems to be straightforward it involves some qualitative differences: dominance of plasma self-heating by alpha particles, huge neutron load on all components, activation of the device, just to name a few. The paper gives an overview of the stand of fusion research, key components of a fusion reactor and simulation possibilities and needs in the hope to help modelers in other fields to contribute to the development of fusion power.
A DSP powered solid state audio system
Authors: J. Kridner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

New audio compression algorithms and non-volatile flash memory technology have enabled the creation of portable solid-state personal audio players. This paper presents a low-power portable audio system based on the Texas Instruments TMS320C5000 DSP family. This system is designed to play music and other audio media stored on flash memory cards that can hold over an hour of CD quality music. The flash card provides higher audio quality than a cassette tape, yet is smaller and more durable than a CD. The music or audio material downloaded to the flash is obtained from licensed distributors, either through the Internet or through kiosks setup in retail outlets. All the audio decoding and watermarking required by this system is handled by the TMS320C5000 DSP. System performance characteristics are also presented.
Policy-Based Threshold for Bandwidth Reservation in WiMax and WiFi Wireless Networks
Authors: Tara Ali Yahiya, Andre-Luc Beylot, Guy Pujolle
Venue: Proceedings of the Third International Conference on Wireless and Mobile Communications (2007)

A well designed resource allocation policy is important for network operators, especially in emerging networks with scarce resources such as wireless and mobile networks. Two promising wireless technologies nowadays are Wireless Metropolitan Area Network (WMAN) and Wireless Local Area Network (WLAN). The latter is already largely deployed whereas the former is more recently getting deployed as the wireless broadband access network. For better and cheaper wireless coverage extension, the integration of these two technologies seems to be a very good option. In this paper we analyze an admission control residing in the WiMax Base Station (BS) for resource allocation in the integrated WiFi-WiMax architecture. A mathematical model is introduced where the resource allocation is based on two thresholds corresponding to voice/data traffic from WiFi network and voice/data from WiMax network. The results of our analysis show clearly that a well designed resource allocation policy improves the usage of combined WiFi-WiMax network, therefore increasing the number of served users which will raise the operator's profits.
Online Dynamic Voltage Scaling using Task Graph Mapping Analysis for Multiprocessors
Authors: Pravanjan Choudhury, P. P. Chakrabarti, Rajeev Kumar
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents a run-time slack distribution strategy for precedence constrained task graphs mapped on to a voltage scalable multi-processor platform. Online Dynamic Voltage Scaling techniques use the slack formed due to early finish of tasks and lower the supply voltage suitably so that energy reduction is achieved while meeting the worst-case deadline of the task graph. Given a task graph mapping on a multiprocessor, the proposed offline analysis phase calculates expected slack and expected computation ahead of each task. The online voltage scheduler uses these values and the current slack to decide the voltage and frequency of execution of the next scheduled task in order to minimize expected energy dissipation. Results show improvement in average energy saving with this methodology over most of the presently known online techniques.
Transpiring Interfaces: Turning Transparency on Its Head
Authors: Hamid R. Ekbia
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

The contrastive understandings of the notion of transparent design by designers and researchers are investigated, and a different perspective is presented on the basis of ideas from distributed cognition, active learning, and ubiquitous computing.
Vanishing of 3-loop Jacobi diagrams of odd degree
Authors: Daniel Moskovich, Tomotada Ohtsuki
Venue: Journal of Combinatorial Theory Series A (2007)

We prove the vanishing of the space of 3-loop Jacobi diagrams of odd degree. This implies that no 3-loop Vassiliev invariant can distinguish between a knot and its inverse.
Neural networks-based approximation of fuzzy systems
Authors: X. Z. Gao, S. J. Ovaska
Venue: Integrated Computer-Aided Engineering (2003)

During recent years, fuzzy-neural networks have found extensive applications in numerous engineering areas. It is well known that the fusion of neural networks and fuzzy logic can overcome their individual drawbacks and benefit merits from each other. However, current fuzzy-neural networks often have complex structures and training algorithms. In addition, some of them cannot deal with fuzzy knowledge directly. Inspired by the &alpha;-level cut representation of fuzzy numbers, we propose a simple neural networks-based approach to approximating fuzzy rules in this paper. Using numerical simulations, our scheme is illustrated capable of coping with fuzzy input and output without any need for a new network topology or learning algorithm.
Tribeca: a system for managing large databases of network traffic
Authors: Mark Sullivan, Andrew Heybey
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

The engineers who analyze traffic on high bandwidth networks must filter and aggregate either recorded traces of network packets or live traffic from the network itself. These engineers perform operations similar to database queries, but cannot use conventional data managers because of performance concerns and a semantic mismatch between the analysis operations and the operations supported by commercial DBMSs. Traffic analysis does not require fast random access, transactional update, or relational joins. Rather, it needs fast sequential access to a stream of traffic records and the ability to filter, aggregate, define windows, demultiplex, and remultiplex the stream. Tribeca is an extensible, stream-oriented DBMS designed to support network traffic analysis. It combines ideas from temporal and sequence databases with an implementation optimized for databases stored on high speed ID-1 tapes or arriving in real time from the network. The paper describes Tribeca's query language, executor and optimizer as well as performance measurements of a prototype implementation.
Wireless communications: the fundamentals
Authors: T. G. Hodgkinson
Venue: BT Technology Journal (2007)

The primary aim of this paper is to provide an overview of wireless communication fundamentals, and the approach used considers them within the context of the following four categories -- radio propagation, wireless air interface, advanced antenna systems and interference effects. In addition to this, a representative set of mobile systems are compared to show that their differences are primarily due to them having different combinations of channel transport, modulation scheme and regulatory constraints on transmit power, channel bandwidth, operating frequency and channel duplex.
Lightweight Static Capabilities
Authors: Oleg Kiselyov, Chung-chieh Shan
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients:(i)A compact kernel of trust that is specific to the problem domain. (ii)Unique names (capabilities) that confer rights and certify properties, so as to extend the trust from the kernel to the rest of the application. (iii)Static (type) proxies for dynamic values. We illustrate our approach using examples from the dependent-type literature, but our programs are written in Haskell and OCaml today, so our techniques are compatible with imperative code, native mutable arrays, and general recursion. The three ingredients of this programming style call for (1) an expressive core language, (2) higher-rank polymorphism, and (3) phantom types.
Bayesian approach to best basis selection
Authors: J.-C. Pesquet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Wavelet packets and local trigonometric bases provide an efficient framework and fast algorithms to obtain a "best basis" or "best representation" of deterministic signals. Applying these deterministic techniques to stochastic processes may, however, lead to variable results. We revisit this problem and introduce a prior model on the underlying signal in noise and account for the contaminating noise model as well. We thus develop a Bayesian-based approach to the best basis problem, while preserving the classical tree search efficiency.
A Cluster-based Approach to Filtering Spam under Skewed Class Distributions
Authors: Wen-Feng Hsiao, Te-Ming Chang, Guo-Hsin Hu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The purpose of this research is to propose an appropriate classification approach to improving the effectiveness of spam filtering on the issue of skewed class distributions. A clustering-based classifier is proposed to first cluster documents into several groups, and then an equal number of keywords are extracted from each group to alleviate the problem caused by skewed class distributions. Experiments are conducted to validate the effectiveness of the proposed classifier. The results show that our proposed classifier can effectively deal with the issue of skewed class distributions in the task of spam filtering.
Visualising and interpreting individual student models developed whilst learning the foundations of object oriented programming
Authors: C. Burrell
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Computer programmers require three types of knowledge. The syntactic knowledge of specific facts about a programming language and rules for its use. A conceptual understanding of computer programming constructs and principles and programming specific versions of strategic problem solving skills. Each can be divided into declarative knowledge and procedural knowledge. A microworld has been implemented, with the ability to record both student actions and data relevant to the programs they produce. This microworld allows students to concentrate on the structure of the code they are designing and implementing. System usage information and object oriented metrics allow the development of knowledge, skills and problem solving ability to be recorded. The graphical representation of the data, for tutorial support is discussed. 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
Higher-Order Matching, Games and Automata
Authors: Colin Stirling
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Higher-order matching is the problem given t = u where t, u are terms of simply typed \lambda-calculus and u is closed, is there a substitution \theta such that t\theta and u have the same normal form with respect to \beta \eta-equality: can t be pattern matched to u? This paper considers the question: can we characterize the set of all solution terms to a matching problem? We provide an automata-theoretic account that is relative to resource: given a matching problem and a finite set of variables and constants, the (possibly infinite) set of terms that are built from those components and that solve the problem is regular. The characterization uses standard bottom-up tree automata.
Constrained strip generation and management for efficient interactive 3D rendering
Authors: P. Diaz-Gutierrez, A. Bhushan, M. Gopi, R. Pajarola
Venue: Proceedings of the Computer Graphics International 2005 (2005)

Representing a triangulated two manifold using a single triangle strip is an NP-complete problem. By introducing a few Steiner vertices, recent works find such a single-strip and hence a linear ordering of edge-connected triangles of the entire triangulation. In this paper, we highlight and exploit this linear order in efficient triangle-strip management for high-performance rendering. We present new algorithms to generate weighted single-strip representations that respect different constraint-based clustering of triangles. These functional constraints can be application dependent; for example, normal-based constraints for efficient visibility culling or spatial constraints for highly coherent vertex-caching. We also present a hierarchical single-strip-management strategy for high-performance interactive 3D rendering.
Standard and Genetic k-means Clustering Techniques in Image Segmentation
Authors: Dariusz Malyszko, Slawomir T. Wierzchon
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Clustering or data grouping is a key initial procedure in image processing. This paper deals with the application of standard and genetic k-means clustering algorithms in the area of image segmentation. In order to assess and compare both versions of k-means algorithm and its variants, appropriate procedures and software have been designed and implemented. Experimental results point that genetically optimized k-means algorithms proved their usefulness in the area of image analysis, yielding comparable and even better segmentation results.
Interactive Web Visualisation of Proposals for Site Developments
Authors: Robina Hetherington, Brian Farrimond, Paul Clynch
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

X3D (eXtensible 3 Dimensions), the international standard for Web 3D, offers opportunities for the dynamic display and interoperability of data over the World Wide Web. One potential application relates to the process of urban planning in which applications are required to be made readily available for public comment. Relevant information is typically presented in the form of site plans and a limited number of architectural drawings that can be difficult for the general public to fully comprehend. Web3D models of proposals in the context of the site and viewed from different directions have the potential to provide the general public and the planning authority with a better understanding of the visual impact of the proposals. This paper, through a case study of a proposed residential development, demonstrates the use of standard web browser as a GUI (Graphical User Interface) to control the display of a 3D model. The interactive, client side, visualization is achieved using AJAX (Asynchronous JavaScript and XML).
Surface distance maps
Authors: Avneesh Sud, Naga Govindaraju, Russell Gayle, Erik Andersen, Dinesh Manocha
Venue: Proceedings of Graphics Interface 2007 (2007)

We present a new parameterized representation called surface distance maps for distance computations on piecewise 2-manifold primitives. Given a set of orientable 2-manifold primitives, the surface distance map represents the (non-zero) signed distance-to-closest-primitive mapping at each point on a 2-manifold. The distance mapping is computed from each primitive to the set of remaining primitives. We present an interactive algorithm for computing the surface distance map of triangulated meshes using graphics hardware. We precompute a surface parameterization and use the it to define an affine transformation for each mesh primitive. Our algorithm efficiently computes the distance field by applying this affine transformation to the distance functions of the primitives and evaluating these functions using texture mapping hardware. In practice, our algorithm can compute very high resolution surface distance maps at interactive rates and provides tight error bounds on their accuracy. We use surface distance maps for path planning and proximity query computation among complex models in dynamic environments. Our approach can perform planning and proximity queries in a dynamic environment with hundreds of objects at interactive rates and offer significant speedups over prior algorithms.
Behavioral synthesis of property specification language (PSL) assertions
Authors: Harald Obereder, Markus Pfaff
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

In recent years more and more system designers discovered the importance of Assertion Based Verification (ABV) in coverage driven, functional simulations to keep pace with ever-increasing complexity of modern systems on chip (SoC). Using assertions plays a central role in the designfor- verification (DFV) methodology which is widely used in the industry. This paper presents a method that enables the major advantages of ABV beyond the borders of synthesis. By the use of the Property Specification Language (PSL) a way for the behavioral synthesis of properties will be shown. Furthermore the paper explains the integrated simulation of these hardware assertions by the aid of a hardware accelerator and cosimulator. Overall, the presented approach can decrease the time to market while raising the quality for complex SoCs at the same time.