ppxscal/embedding_network huggingface dataset:
2nd InternationalWorkshop on Realising Evidence-Based Software Engineering (REBSE-2): Overview and Introduction
Authors: Barbara Kitchenham, David Budgen, Pearl Brereton, Mark Turner
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The REBSE international workshops are concerned with exploring the adaptation and use of the evidence-based paradigm in software engineering research and practice, through a mix of presentations and discussion. Here, we provide some background about evidence-based software engineering and its current state.
Tutorial IND1B: Realtime Operating Systems for Embedded Systems Development
Authors: Uma Maheswar Rao, Suneel Sinha, Naveen Shenoy
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A Tutorial on "Real-time Operating Systems for Embedded Software Development", addressing several Industry Verticals such as Network Equipment Providers, Consumer Devices, Automotive Devices, Aerospace & Defense including Safety Critical, Industrial Devices, and so on. This tutorial is not just about the basics of Real-Time Operating Systems such as Priority based Preemption, but also includes very important features such as Priority Inversion, Advanced Memory Protection, Error Management, POSIX Compliance, Comprehensive Networking and Wireless Stack, Security Protocols, Carrier Grade Networking, Small Footprint, TIPC, Multimedia, Connectivity Middleware, Support for CAN, USB, IPV4/IPVT6, DCOM, OPC, and WiFi etc. Also covers interesting topics such as why a Round Robin Scheduling is not exactly required for Safety Critical Avionics Applications etc, and what are ARINC 653 Compliance and DO178B Certification for Aerospace and Defense Industry. The other topics include various Software and Hardware Development and Diagnostics Tools available with Real-time Operating Systems from hardware bring up to platform and application development.
Delta execution for efficient state-space exploration of object-oriented programs
Authors: Marcelo d'Amorim, Steven Lauterburg, Darko Marinov
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

State-space exploration is the essence of model checking and an increasingly popular approach for automating test generation. A key issue in exploration of object-oriented programs is handling the program state, in particular the heap. Previous research has focused on standard program execution that operates on one state/heap. We present Delta Execution, a technique that simultaneously operates on several states/heaps. It exploits the fact that many execution paths in state-space exploration partially overlap and speeds up the exploration by sharing the common parts across the executions and separately executing only the "deltas" where the executions differ. We have implemented Delta Execution in JPF, a popular general-purpose model checker for Java programs, and in BOX, a specialized model checker that we have developed for efficient exploration of sequential Java programs. We have evaluated Delta Execution for (bounded) exhaustive exploration of ten basic subject programs without errors. The experimental results show that on average Delta Execution improves the exploration time 10.97x (over an order of magnitude) in JPF and 2.07x in BOX. We have also evaluated Delta Execution for one larger case study with errors, where the exploration time improved up to 1.43x.
Dimension reduction of microarray data based on local tangent space alignment
Authors: Li Teng, Hongyu Li, Xuping Fu, Wenbin Chen
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

We introduce the new nonlinear dimension reduction method: LTSA, in dealing with the difficulty of analyzing high-dimensional, nonlinear microarray data. Firstly, we analyze the applicability of the method and we propose the reconstruction error of LTSA. The method is tested on Iris data set and acute leukemias microarray data. The results show good visualization performance. And LTSA outperforms PCA on determining the reduced dimension. There is only subtle change in the clustering correctness after dimension reduction by LTSA. It is evident that application of nonlinear dimension reduction techniques could have a promising perspective in microarray data analysis.
Java virtual machine timing probes: a study of object life span and garbage collection
Authors: Qian Yang
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

The performance issues of garbage collection (GC) have been studied for over three decades. This paper uses a new cycle accurate timing tool to measure GC metrics such as allocation latencies, component elapse time (mark, sweep, and compact) and object life span. The data are then used to derive runtime heap residency and overall GC time. In the past, researchers study object life span through a space based approach, where the amount of allocated memory determines GC invocations. We propose a tune based methodology as a complement. Time plays an important role in server environments, where allocations can come in bursts. The experimental results indicate that a time based approach yields significantly less GC calls, while maintains almost the same heap residency as the space based approach. This translates to a more efficient way to collect garbage.
Distinct Regions of the Medial Prefrontal Cortex Are Associated with Self-referential Processing and Perspective Taking
Authors: Arnaud D'Argembeau, Perrine Ruby, Fabienne Collette, Christian Degueldre, Evelyne Balteau, André Luxen, Pierre Maquet, Eric Salmon
Venue: Journal of Cognitive Neuroscience (2007)

The medial prefrontal cortex (MPFC) appears to play a prominent role in two fundamental aspects of social cognition, that is, self-referential processing and perspective taking. However, it is currently unclear whether the same or different regions of the MPFC mediate these two interdependent processes. This functional magnetic resonance imaging study sought to clarify the issue by manipulating both dimensions in a factorial design. Participants judged the extent to which trait adjectives described their own personality (e.g., “Are you sociable?”) or the personality of a close friend (e.g., “Is Caroline sociable?”) and were also asked to put themselves in the place of their friend (i.e., to take a third-person perspective) and estimate how this person would judge the adjectives, with the target of the judgments again being either the self (e.g., “According to Caroline, are you sociable?”) or the other person (e.g., “According to Caroline, is she sociable?”). We found that self-referential processing (i.e., judgments targeting the self vs. the other person) yielded activation in the ventral and dorsal anterior MPFC, whereas perspective taking (i.e., adopting the other person's perspective, rather than one's own, when making judgments) resulted in activation in the posterior dorsal MPFC; the interaction between the two dimensions yielded activation in the left dorsal MPFC. These findings show that self-referential processing and perspective taking recruit distinct regions of the MPFC and suggest that the left dorsal MPFC may be involved in decoupling one's own from other people's perspectives on the self.
Incorporating application semantics and control into compilation
Authors: Dawson R. Engler
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Programmers have traditionally been passive users of compilers, rather than active exploiters of their transformational abilities. This paper presents MAGIK, a system that allows programmers to easily and modularly incorporate application-specific extensions into the compilation process. The MAGIK system gives programmers two significant capabilities. First, it provides mechanisms that implementors can use to incorporate application semantics into compilation, thereby enabling both optimizations and semantic checking impossible by other means. Second, since extensions are invoked during the translation from source to machine code, code transformations (such as software fault isolation [14]) can be performed with full access to the symbol and data flow information available to the compiler proper, allowing them both to exploit source semantics and to have their transformations (automatically) optimized as any other code.
Effective management for aggregated flows in server-based QoS routing
Authors: T. Ikenaga, T. Nakashima, K. Iida
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The support of real-time applications on the Internet requires a routing mechanism that provides quality-of-service. Such mechanisms called QoS routing can be realized by server-based routing method. However, in large-scale networks, the processing load imposed on the server would be too high. We focus here on the use of flow aggregation schemes as a way of reducing the processing load. From simulation results, roughly speaking, as a trunk can accommodate a larger number of flows within it, a smaller processing load can be realized on the server at the cost of increased blocking probability.
Interactive presentation: Process tolerant &beta;-ratio modulation for ultra-dynamic voltage scaling
Authors: Myeong-Eun Hwang, Tamer Cakici, Kaushik Roy
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Most wireless and hand-held gadgets work in burst mode, and the performance demand varies with time. When the performance requirement is low, the supply voltage can be dithered and the circuit can enter from superthreshold region to subthreshold region (Vdd < VT). Such ultra dynamic voltage scaling (UDVS), where the supply voltage switches from 1.2V to 200mV (say), enables remarkable decrease in power consumption with "acceptable" performance penalty in the non-burst mode of operation. However, subthreshold operation is very sensitive to process variation (PV) due to the reduced noise margin, and may not work properly unless corrective measures are taken. In this paper, we model the trip voltage in both subthreshold and superthreshold regions, and analyze the impact of PV in UDVS. We also propose a circuit design technique such that the same logic gate can efficiently operate in both superthreshold and subthreshold regions under PV. We do that by modulating the &beta;-ratio (P-to-N ratio) of the logic gates. By proper &beta;-ratio modulation, we show that the proposed methodologies can lower energy dissipation per cycle by more than an order of magnitude (42X) in non-burst mode with reduced impact to PVs.
A new synchronization algorithm for OFDM systems in multipath environment
Authors: Liang Wang, Xiuming Shan, Yong Ren
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Carrier frequency and symbol timing errors may greatly degrade the performance of the orthogonal frequency division multiplexing (OFDM) system, especially in multipath environment. We explore the cyclostationarity of OFDM signals, which only relies on second order statistics, to estimate the synchronization offset. First, a coarse carrier frequency offset estimator for multipath environment is developed using the second order statistics of the received OFDM signal. It has a wide capture range though not accurate. Second, we introduce a new synchronization algorithm based on cyclostationarity and matched filter theories, which can get the maximal estimation SNR in multipath environment. Both estimators utilize channel state information to achieve better estimation performance and are non-pilot aided. They can be combined to form a whole OFDM synchronizer in multipath environment. Finally, simulations confirm the performance of the estimation algorithm.
Computing the Nearest Doubly Stochastic Matrix with A Prescribed Entry
Authors: Zheng-Jian Bai, Delin Chu, Roger C. E. Tan
Venue: SIAM Journal on Scientific Computing (2007)

In this paper a nearest doubly stochastic matrix problem is studied. This problem is to find the closest doubly stochastic matrix with the prescribed $(1,1)$ entry to a given matrix. According to the well-established dual theory in optimization, the dual of the underlying problem is an unconstrained differentiable, but not twice differentiable, convex optimization problem. A Newton-type method is used for solving the associated dual problem, and then the desired nearest doubly stochastic matrix is obtained. Under some mild assumptions, the quadratic convergence of the proposed Newton method is proved. The numerical performance of the method is also demonstrated by numerical examples.
Assessing student learning outcomes using graduating senior exit surveys and alumni surveys
Authors: S. C. Schneider, R. J. Niederjohn
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

In Spring of 1994, the Department of Electrical and Computer Engineering began the process of surveying both graduating seniors and alumni from the graduating classes of 1992, 1988, 1984 and 1980. These surveys were again distributed in Spring of 1995 to alumni in the classes of 1993, 1989, 1985, and 1981, as well as all students enrolled in the senior engineering design course. The primary purpose of the surveys distributed to our alumni and graduating seniors was to begin the process of "assessment of student learning outcomes". The department has developed four primary educational objectives. These educational objectives are intended to probe not only our students attainment of knowledge specific to the field, but also to cause them to reflect upon how those aspects of education unique to Marquette University as a Catholic, Jesuit institution of higher learning have fostered their attitudes toward their jobs and their fellow humans. From the objectives, several assessment criteria were proposed which then led to the development of the survey instruments that were used. A secondary purpose of these surveys was to determine alumni attitudes to various features of the electrical engineering curriculum and to see if these attitudes change as our alumni progress through their careers. A third purpose of the survey was to develop some demographic information about our alumni. The specific details of the graduate exit surveys and alumni surveys used by the Department of Electrical and Computer Engineering are discussed including the educational objectives, assessment criteria, and resulting survey instruments. In addition, partial results from these surveys are described particularly referencing the success of the department in attaining its educational objectives and as a planning document for curriculum modification.
An HLLC Scheme to Solve The M1 Model of Radiative Transfer in Two Space Dimensions
Authors: Christophe Berthon, Pierre Charrier, Bruno Dubroca
Venue: Journal of Scientific Computing (2007)

The M 1 radiative transfer model is considered in the present work in order to simulate the radiative fields and their interactions with the matter. The model is governed by an hyperbolic system of conservation laws supplemented by relaxation source terms. Several difficulties arise when approximating the solutions of the model; namely the positiveness of the energy, the flux limitation and and the limit diffusion behavior have to be satisfied. An HLLC scheme is exhibited and it is shown to satisfy all the required properties. A particular attention is payed concerning the approximate extreme waves. These approximations are crucial to obtain an accurate scheme. The extension to the full 2D problem is proposed. It satisfies, once again, all the expected properties. Numerical experiments are proposed. They show that the considered scheme is actually less diffusive than the currently used numerical methods.
New aspects of simulation in hot-embossing
Authors: M. Worgull, M. Heckele
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

Hot embossing is especially well suited for manufacturing small and medium volume series. However a wider diffusion of this process is currently seriously hampered by the lack of adequate simulation tools for process optimization and part design. This lack of simulation tools is becoming critical as the dimensions of the microstructures continuously shrink from micron and sub-micron towards nano-scales and as productivity requirements dictate the enlargement of formats to process larger numbers of devices in parallel. Having no macroscopic equivalent the micro hot embossing process cannot be described by simple down scaling of existing software tools like in injection molding. In this paper a first access is described how numerical simulation also can be applied to the hot embossing process.
An Automatic Software Decentralization Framework for Distributed Device Collaboration
Authors: Yohei Iwasaki, Nobuo Kawaguchi
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Recently, many low-profile devices with RF communication features have been developed such as sensor network nodes and one-chip microcomputers. This caused a variety of gadgets join to the wireless network. However, in order to realize collaborations between these devices, generally we have to develop complicated distributed software. In this paper, we propose an automatic software decentralization method, which converts a stand-alone software program into distributed software programs. In order to execute the generated software on these low-profile devices, we employ the programming language nesC for a decentralization target. We also have implemented applications with real hardware devices to exemplify that the proposed method successfully improves the ease of development.
Full Parallelism in Uniform Nested Loops Using Multi-Dimensional Retiming
Authors: Nelson Luiz Passos, Edwin Hsing-Mean Sha
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Most scientific and DSP applications are recursive or iterative. Uniform nested loops can be modeled as multi-dimensional data flow graphs (DFGs). To achieve full parallelism of the loop body, i.e., all the computational nodes executed in parallel, substantially decreases the overall computation time. It is well known that for one-dimensional DFGs retiming can not always achieve full parallelism. This paper shows an important and counter-intuitive result, which proves that we can always obtain full-parallelism for DFGs with more than one dimension. It also presents two novel multi-dimensional retiming techniques to obtain full parallelism.
Essential Matrix Estimation Using Gauss-Newton Iterations on a Manifold
Authors: Uwe Helmke, Knut Hüper, Pei Yean Lee, John Moore
Venue: International Journal of Computer Vision (2007)

A novel approach for essential matrix estimation is presented, this being a key task in stereo vision processing. We estimate the essential matrix from point correspondences between a stereo image pair, assuming that the internal camera parameters are known. The set of essential matrices forms a smooth manifold, and a suitable cost function can be defined on this manifold such that its minimum is the desired essential matrix. We seek a computationally efficient optimization scheme towards meeting the demands of on-line processing of video images. Our work extends and improves the earlier research by Ma et al., who proposed an intrinsic Riemannian Newton method for essential matrix computations. In contrast to Ma et al., we propose three Gauss-Newton type algorithms that have improved convergence properties and reduced computational cost. The first one is based on a novel intrinsic Newton method, using the normal Riemannian metric on the manifold consisting of all essential matrices. The other two methods are Newton-like methods, that are more efficient from a numerical point of view. Local quadratic convergence of the algorithms is shown, based on a careful analysis of the underlying geometry of the problem.
The design and implementation of a DCD device driver for Unix
Authors: Tycho Nightingale, Yiming Hu, Qing Yang
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

Recent research results [1, 2] using simulation have demonstrated that Disk Caching Disk (DCD), a new disk I/O architecture, has the potential for drastically improving disk write performance besides its higher reliability than traditional disk systems. To validate whether DCD can live up to its promise in the real world environment, we have designed and implemented a DCD device driver for the Sun's Solaris operating system. Measured performance results are very promising. For metadata intensive benchmarks, our DCD driver outperforms the traditional system by a factor of 2-6 in terms of program execution speeds. The driver also guarantees file system integrity in the events of system crashes or failures. Moreover, unlike other approaches such as Log-structured File Systems or Soft Updates, the DCD driver is completely transparent to the OS. It does not require any changes to the OS or the on-disk data layout. As a result, it can be used as a "drop-in" replacement for the traditional disk device driver in an existing system to obtain immediate performance improvement. Our multi-layered device-driver approach significantly reduces the implementation overhead and improves portability.
Speedy Task Migration in Hypercube Systems
Authors: Hsing-Lung Chen, Nian-Feng Tzeng
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

This article considers speedy task migration in that two disjoint paths are created between every pair of corresponding nodes for delivering migrated information simultaneously, reducing the size of data transmitted over a path and thus the migration time. All migration paths selected are pairwise disjoint and contain no link of active subcubes, so that task migration can be performed quickly and without interrupting the execution of other jobs.
Pursuit-Evasion Voronoi Diagrams in \ell_1
Authors: Warren Cheung, William Evans
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader's region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path from its starting point without encountering a pursuer along the way. The evader and the pursuers must obey their start time and speed constraints, and cannot go through obstacles. The partition of the plane into the evader's region and the remaining pursuers' region is called the pursuit-evasion Voronoi diagram. We study pursuit-evasion Voronoi diagrams for the \ell_1 metric. We show that the complexity of the diagram is O((n +m)^2(mn+m)) and that it can be calculated in polynomial time.
Perceptual (Re)learning: A Leverage Point for Human-Centered Computing
Authors: Robert R. Hoffman, Stephen M. Fiore
Venue: IEEE Intelligent Systems (2007)

This column explores the conjunction of two facts: (1) experts can perceive things that are invisible to the novice and (2) it takes a decade or more for someone to become an expert in most significant domains. This conjunction represents a leverage point for intelligent systems—not from the Turing Test perspective of building machines that emulate humans but from the human-centered computing perspective of amplifying and extending human capabilities.