ppxscal/embedding_network huggingface dataset:
Proceedings of the 2008 international working conference on Mining software repositories
Venue: International Conference on Software Engineering (2008)

Willkommen/bienvenues/welcome to the 2008 Working Conference on Mining Software Repositories in Leipzig, Germany! This year marks the debut of MSR as a Working Conference, after four successful years as ICSE's largest workshop. During this time, our research community has grown significantly. We have seen tremendous advances in the depth and scope of the kinds of research questions we are investigating. Furthermore, we have also expanded the breadth of MSR into areas such as social network analysis and visualization. So what does is mean to be a working conference this year? It means that the maturity of the work and the quality of the papers have made MSR a venue of choice for research in this area. And MSR is a working conference, not just a static repository of dry research results. We will continue to hold discussions as being central to the mission of the MSR event. We will continue to accept short papers whose novelty stirs discussion. And we will continue to hold the MSR challenge, where researchers participate in a qualitative competition, using their own techniques to attack a common problem. This year, the timing was much tighter than we might have liked, requiring a very short turnaround for authors from the announced CFP to the final submission deadline. The tight schedule also put a burden on the program committee, who responded magnificently! The call for papers attracted 42 submissions (21 full papers and 21 short papers) from Germany, Canada, USA, Switzerland, UK, Japan, Spain, the Netherlands, Austria, Greece, the Czech Republic, and India. Eight of the 21 full papers were accepted as such, and another four were accepted as short papers. Twelve of the 21 short paper submissions were also accepted. We are very pleased to offer two invited talks this year. First, Prof. Carlo Ghezzi of the Politechnico di Milano will give a keynote address entitled: Dynamically Evolving Software: Some Radical Changes of Perspective. Our second day will lead off with an invited tutorial by Prof. Abraham (Avi) Bernstein of the University of Zürich on data mining and machine learning. In addition to the papers and discussion sessions, we have a session devoted to this year's MSR Mining Challenge.
Multi-criteria decision analysis for customization of estimation by analogy method AQUA+
Authors: Jingzhou Li, Guenther Ruhe
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

The quality of results from a predictor model depends on the proper customization of the parameters of the model. For Estimation by Analogy (EBA), the impact of the parameter "Attribute weighting technique" has been shown by several authors. The decision problem "Which attribute weighting technique is preferable for EBA in which situation?" is considered in this paper from the perspective of multi-criteria decision analysis (MCDA). The empirical results are given for the EBA method AQUA+. More specifically, two MCDA techniques, ELECTRE and Pareto-optimality are applied. Three evaluation criteria MMRE (Mean Magnitude of Relative Error), Pred (Prediction at certain accuracy level), and Strength are considered. We discuss the insights gained from this more in-depth decision analysis for the stated decision problem.
WiFi-Based Power Aware Pervasive Device
Authors: Yiqiang Chen, Mingqing Hu, Qingsheng Yuan, Junfa Liu
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper, we propose a new kind of WiFi-based embedded device and two power efficient killer applications on it. First, the definition of our pervasive device and the key challenge research issues on it is introduced. Then we specially present our work on it, including hardware and software part. For hardware part, we will show our new Loongson SOC (system on a chip) chip based hardware architecture, which is power efficient and flexible connective interface one. For software part, we focus on two killer applications for this kind of pervasive device: location estimation and video codec. The power aware method we used in above two applications will be introduced in detail.
Can we create a viable free open source alternative to magma, maple, mathematica and matlab?
Authors: William A. Stein
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

The goal of the Sage project (http://sagemath.org) is to create a truly viable free open source alternative to Magma, Maple, Mathematica and Matlab. Is this possible?
Heuristics And Qualitative Rules For The Performance Design Of Collaborative Systems
Authors: Tad Gonsalves, Kiyoshi Itoh
Venue: Journal of Integrated Design Process Science (2006)

The domain expert's heuristics in the performance design and improvement of collaborative systems are systematized as Qualitative rules. A knowledge base system built by using the Qualitative rules diagnoses the bottlenecks in the system operation and suggests improvements or tuning. However, the bottlenecks cannot be completely resolved due to the constraints imposed on the system resources. In such a case, our strategy is to resolve the local bottlenecks, while maintaining the global stability of the system. To enforce this strategy, we demarcate the system model into local, upstream and downstream sections, and set up the Qualitative improvement rules for each of these sections. A performance improvement task is then guided by a set of local, forward propagation, backward propagation and global rules. Local rules correspond to a local improvement. When the local rules fail to yield satisfactory results, the backward propagation rules are called upon to indicate the improvements to be made in the upstream of the network so as to resolve the problematic local bottleneck. The forward propagation rules estimate the effects on the downstream of the network due to the resolution of the chosen bottleneck. Finally, the advisability of resolving a local bottleneck, while keeping the global adverse effects to a minimum, is given by the global rules.
Servo: a programming model for many-core computing
Authors: Nicolas Zea, John Sartori, Rakesh Kumar
Venue: ACM SIGARCH Computer Architecture News (2008)

Conventional programming models were designed to be used by expert programmers for programming for large-scale multiprocessors, distributed computational clusters, or specialized parallel machines. These models, therefore, are deemed either too difficult for an "average" programmer (who will be expected to do parallel programming in the many-core world) or too inefficient to use for many-core architectures [3]. Similarly, conventional execution models were designed for performance, not scalability. To address the challenge of performance scalability for many-core architectures, we introduce Servo, a Service Oriented programming model that decomposes every program into a set of components (each with its own local memory, mutable state, and a program counter) that either request services or deliver services. Servo is characterized by the decoupling of logical communication mapping between program modules (or services) from physical communication mapping between modules. This allows the services to be migrated and replicated during execution. The proposed model also allows the granularity of data parallel operations to be changed dynamically. This allows runtime variation in the locking granularity which in turn enables higher write-parallelism. Finally, the models partition even data into services. This can significantly enhance locality and makes it possible to have superlinear speedups with increasing number of cores. Our preliminary investigations demonstrate significant performance scalability advantages for Servo.
Digital topology java applet
Authors: Carmen Escribano, Antonio Giraldo, María Asunción Sastre, Mario Trotta
Venue: ACM SIGCSE Bulletin (2008)

We present here a java applet, accessible through the World Wide Web, which allows to apply to a binary digital image a series of topological algorithms for image processing.
Using grammatical evolution for evolving intrusion detection rules
Authors: Dominic Wilson, Devinder Kaur
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The use of Grammatical Evolution for automating the intrusion detection rules is investigated in this paper. We apply this method to the KDD99 intrusion dataset and demonstrate its usefulness in this context. We achieve favorable results by evolving rules for classifying both normal and abnormal traffic.
Using genetic algorithms is computer vision: registering images to 3D surface model
Authors: Zsolt Jankó, Dmitry Chetverikov, Anikó Ekárt
Venue: Acta Cybernetica (2007)

This paper shows a successful application of genetic algorithms in computer vision. We aim at building photorealistic 3D models of real-world objects by adding textural information to the geometry. In this paper we focus on the 2D-3D registration problem: given a 3D geometric model of an object, and optical images of the same object, we need to find the precise alignment of the 2D images to the 3D model. We generalise the photo-consistency approach of Clarkson et al. who assume calibrated cameras, thus only the pose of the object in the world needs to be estimated. Our method extends this approach to the case of uncalibrated cameras, when both intrinsic and extrinsic camera parameters are unknown. We formulate the problem as an optimisation and use a genetic algorithm to find a solution. We use semi-synthetic data to study the effects of different parameter settings on the registration. Additionally, experimental results on real data are presented to demonstrate the efficiency of the method.
Team Cornell's Skynet: Robust perception and planning in an urban environment
Authors: Isaac Miller, Mark Campbell, Dan Huttenlocher, Frank-Robert Kline, Aaron Nathan, Sergei Lupashin, Jason Catlin, Brian Schimpf, Pete Moran, Noah Zych, Ephrahim Garcia, Mike Kurdziel, Hikaru Fujishima
Venue: Journal of Field Robotics (2008)

Team Cornell's Skynet is an autonomous Chevrolet Tahoe built to compete in the 2007 DARPA Urban Challenge. Skynet consists of many unique subsystems, including actuation and power distribution designed in-house, a tightly coupled attitude and position estimator, a novel obstacle detection and tracking system, a system for augmenting position estimates with vision-based detection algorithms, a path planner based on physical vehicle constraints and a nonlinear optimization routine, and a state-based reasoning agent for obeying traffic laws. This paper describes these subsystems in detail before discussing the system's overall performance in the National Qualifying Event and the Urban Challenge. Logged data recorded at the National Qualifying Event and the Urban Challenge are presented and used to analyze the system's performance. &copy; 2008 Wiley Periodicals, Inc.
Comparison of innovative signature algorithms for WSNs
Authors: Benedikt Driessen, Axel Poschmann, Christof Paar
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

For many foreseen applications of Wireless Sensor Networks (WSN) - for example monitoring the structural health of a bridge - message integrity is a crucial requirement. Usually, security services such as message integrity are realized by symmetric cryptography only, because asymmetric cryptography is often stated as impracticable for WSN. However, the proposed solutions for symmetric key establishment introduce a significant computation, storage, and - most important - communication overhead. Digital signatures and key-exchange based on asymmetric algorithms would be very valuable though. In the literature nearly only RSA and ECC are implemented and compared for sensor nodes, though there exist a variety of innovative asymmetric algorithms. To close this gap, we investigated the efficiency and suitability of digital signature algorithms based on innovative asymmetric primitives for WSN. We chose XTR-DSA and NTRUSign and implemented both (as well as ECDSA) for MICAz motes.
An introduction to programming curriculum including elements of mathematics, art, and creative writing (abstract only)
Authors: Dean Zeller
Venue: ACM Communications in Computer Algebra (2008)

During the Fall 2007 and Spring 2008 semesters, I tested a new style of teaching introductory programming in which graphics are covered early in the curriculum. Students gained familarity with the XY-Coordinate system used by most graphics packages. They used this system to create scalable (size and location) and color paraterizable graphics for use in other graphics. The mathematical properties of sine and cosine were used to generate points evenly distributed around a circle. Objects were collected into a function library to encourage collaboration. All this was finally used to create an interactive illustrated story. This new style of programming pedagogy can be applied to teaching middle- or high-school level mathematic.
Regional Variance Dependant Sub-frame Reduction for Face Detection in High Definition Video Frames
Authors: Adam R. Livingston, Vijayan K. Asari
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Statistical learning based face detection systems search multiple scale sub-frames of an image or frame of a video stream with a trained classifier to detect face objects. If the frame is large there will be a large number of these sub-frames. Sections of the frame with a regional variance below a predefined threshold do not need to be searched as it is not possible for a face to exist in these spaces. A preprocessing system to eliminate these low variance regions of a frame is presented in this paper. A top down quad-tree deconstruction of the frame is used to accomplish this task. Regional variance is computed and tested to determine if a given quadrant should be further broken down. If below a predefined threshold that region will be eliminated in a mask image. This procedure is continued until all sections are eliminated or a defined tree depth is reached. The resulting mask image is then smoothed and subjected to thresholding, merging the remaining valid search areas. The resulting filled mask is then used to determine whether a given sub-frame should be sent to a Viola-Jones face detection cascade. Preliminary results show promise in reducing the number of sub-frames that must be considered for detection, increasing the speed of the detection system.
Simulation of frequency response masking approach for FIR filter design
Authors: Usman Ali, Shahid A. Khan
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

Recently the attention has to a large extent been paid to the problem of designing perfect reconstruction (PR) filter banks. However, filter banks are most often used in applications where small errors are inevitable and allowed. Imposing PR on a filter bank is then an unnecessarily severe restriction which may lead to a higher arithmetic complexity than is actually required to meet the specification at hand. Much of the efforts have been done to design near PR filter banks using different techniques. One such techniques is by decomposing the overall transfer function of filter into its poly-phase form, all filtering in the interpolators and decimators can be performed at the lowest of the two sampling rates involved resulting in a low overall complexity. Frequency Response Masking (FRM) Approach developed to design FIR filter structures for interpolation and decimation has drawn much attention in the filter designing field. In this paper, simulated results for FRM approach for the designing of FIR filter is presented in a step-by-step fashion in order to elaborate the process. Finally a graphical comparison is made between FIR filter designed using FRM approach and traditional approach.
A Statistical Characterization of CMOS Process Fluctuations in Subthreshold Current Mirrors
Authors: Lei Zhang, Zhiping Yu, Xiangqing He
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A novel method to characterize CMOS process fluctuations in subthreshold current mirrors (SCM) is reported in this paper. The proposed model is succinct in methodology and calculation complexity comparing to the reported statistical models, however, provides favorable estimations of CMOS process fluctuations on the SCM circuit, which makes it being promising for engineering applications. The model statistically abstracts physical parameters, which depend on IC process, into random variables with certain mean values and standard deviations, while aggregating all the random impacts into a discrete martingale. The correctness of proposed method is experimentally verified by an SCM circuit implemented in SMIC 0.18um CMOS 1P6M mixed signal process with a conversion factor of 100 over an input range from 100pA to 1uA. The proposed theory successfully predicted the ~10% of die-to-die fluctuation measured in experiment, and also suggested the ~1mV of threshold voltage standard deviation over a single die, which meets the process parameters suggested by the design kit from the foundry. The deviations between calculated probabilities and measured data are less than 8%. Meanwhile, pertinent suggestions to high fluctuation tolerance subthreshold analog circuits design are also made and discussed.
A new multivariate two-sample randomization test and its application to data from semiconductor environments
Authors: Paolo Amato
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

A new Multivariate Two-Sample Randomization Test is introduced. The test is designed to check the null hypothesis that two multidimensional groups are random samples of the same probability distribution. The test is robust to non Gaussian distribution, to serially correlated data, and outliers. The test can be used to compare either two groups defined a priori, or two groups generated by (for example) a clustering algorithm. The performances of the test are analyzed on simulated two-dimensional datasets, and on a real sixty-dimensional dataset coming from a semiconductor environment.
Virtualization-based autonomic resource management for multi-tier Web applications in shared data center
Authors: Xiaoying Wang, Zhihui Du, Yinong Chen, Sanli Li
Venue: Journal of Systems and Software (2008)

As large data centers emerge, which host multiple Web applications, it is critical to isolate different application environments for security reasons and to provision shared resources effectively and efficiently to meet different service quality targets at minimum operational cost. To address this problem, we developed a novel architecture of resource management framework for multi-tier applications based on virtualization mechanisms. Key techniques presented in this paper include (1) establishment of the analytic performance model which employs probabilistic analysis and overload management to deal with non-equilibrium states; (2) a general formulation of the resource management problem which can be solved by incorporating both deterministic and stochastic optimizing algorithms; (3) deployment of virtual servers to partition resource at a much finer level; and (4) investigation of the impact of the failure rate to examine the effect of application isolation. Simulation experiments comparing three resource allocation schemes demonstrate the advantage of our dynamic approach in providing differentiated service qualities, preserving QoS levels in failure scenarios and also improving the overall performance while reducing the resource usage cost.
Numerical simulation of filamentary discharges with parallel adaptive mesh refinement
Authors: S. Pancheshnyi, P. Ségur, J. Capeillère, A. Bourdon
Venue: Journal of Computational Physics (2008)

Direct simulation of filamentary gas discharges like streamers or dielectric barrier micro-discharges requires the use of an adaptive mesh. The objective of this paper is to develop a strategy which can use a set of grids with suitable local refinements for the continuity equations and Poisson's equation in 2D and 3D geometries with a high-order discretization. The advantages of this approach are presented with a filamentary discharge simulation in plane-plane geometry in nitrogen within the diffusion-drift approximation.
Proceedings of the 2008 workshop on Defects in large software systems
Venue: International Symposium on Software Testing and Analysis (2008)

Welcome to DEFECTS 2008. We are delighted to present a selection of excellent papers focusing on defects in large software systems. The eight accepted technical papers mostly cover topics such as defect detection, defect prediction and mining software repositories, but also usability aspects of static analysis tools. The workshop will also feature a thought-provoking keynote and four short papers. In addition to the technical program, the workshop hosted a defect challenge, in which researchers were encouraged to benchmark their favorite static or dynamic defect localization approach. "Find for a given failure, the location of the defect automatically." The test defects were a subset of real defects from the AspectJ program (collected by the iBugs project at Saarland University). Unfortunately, the challenge did not receive any submissions---maybe the challenge problem was too big or the timeframe too short. In any case, we will try to establish an improved defect challenge at a future venue.
Chebyshev functions and their use for two-dimensional electrostatic problems in elliptic coordinates
Authors: Raul Perez-Enriquez, Ivan Marin-Enriquez, J. L. Marin, R. Riera
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

Separation of the two-dimensional Laplace equation in elliptic coordinates leads to a Chebyshev-like differential equation for both the "angular" and "radial" variables, namely (ηζ); in the case of η the well behaved solution in [-1,1] (its range of definition), are the usual first class Chebyshev polynomials. However, since ζ is defined in [1, ∞), there is a need to construct another solution by, for example, a Frobenius series representation. Using these functions, the complete solution of two-dimensional Laplace's equation in this coordinate system can then be constructed accordingly, and could be used to study a variety of boundary-value electrostatic problems involving infinite conductors and lines of charge. Moreover, the corresponding Green's function for the Laplace operator can also be readily obtained using this procedure, a matter that can be useful in the study of many problems in solid state physics which involve energy levels and/or optical properties of hydrogenic impurities within nanostructures of elliptic shape. These subjects are afforded and discussed in the present communication, some useful trends regarding applications of the result are also given.