ppxscal/embedding_network huggingface dataset:
Dynamic Object Process Graph Extraction for Program Understanding and Protocol Recovery
Authors: Jochen Quante
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

An object process graph (OPG) is a view on the con- trol flow graph from the perspective of a single object. Such a graph can be extracted using static or dynamic program analysis. Similar to program slicing, OPG ex- traction is an enabling technique with applications in many reverse engineering tasks. This Ph.D. thesis is about dynamic extraction of such OPGs and their application for program under- standing and protocol recovery. In a first step, I in- troduce methods for online and offline construction of dynamic OPGs, supporting different languages. The second step is the further transformation and applica- tion of the resulting graphs. The goal of this thesis is to show how they can be used for program comprehension and protocol recovery, and that these two approaches are really beneficial.
Dynamic and adaptive updates of non-quiescent subsystems in commodity operating system kernels
Authors: Kristis Makris, Kyung Dong Ryu
Venue: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 (2007)

Continuously running systems require kernel software updates applied to them without downtime. Facilitating fast reboots, or delaying an update may not be a suitable solution in many environments, especially in pay-per-use high-performance computing clusters and mission critical systems. Such systems will not reap the benefits of new kernel features, and will continue to operate with kernel security holes unpatched, at least until the next scheduled maintenance downtime. To address these problems we developed an on-the-fly kernel updating system that enables commodity operating systems to gain adaptive and mutative capabilities without kernel recompilation or reboot. Our system, DynAMOS, employs a novel and efficient dynamic code instrumentation technique termed adaptive function cloning. Execution flow can be switched adaptively among multiple editions of functions, possibly concurrently running. This approach becomes the foundation for dynamic replacement of non-quiescent kernel subsystems when the timeliness of an update depends on synchronization of multiple kernel paths. We illustrate our experience by dynamically updating core subsystems of the Linux kernel.
Maximum $L^2$-Convergence Rates of the Crank-Nicolson Scheme to the Stokes Initial Value Problem
Authors: Juergen Rodenkirchen
Venue: SIAM Journal on Numerical Analysis (2007)

Let $A$ denote the Stokes operator and $D_{A^{\alpha}}$ the domain of its fractional powers $A^{\alpha}$. We consider the homogeneous Stokes initial value problem with initial data $u(0)=u_{0}\in D_{A^{1+\varepsilon}}$, $\varepsilon \in (0,1)$. For Stokes-like equations the range $\varepsilon \in (0,\frac{1}{4})$ is of special interest, as any solution derived from $\varepsilon \ge \frac{1}{4}$ would necessarily have to satisfy an additional, in practice unverifiable compatibility condition at time $t=0$. Approximating any strong solution $u\in C^{0}([0,\infty ),D_{A^{1+\varepsilon}})$ in time direction on a finite time interval $[0,T]$ with a Crank-Nicolson scheme, we show convergence of order $O(\frac{\tau^{2}}{t^{1-\varepsilon}})$ which is maximal for the assumed regularity of the data and reflects the loss of regularity as $t\rightarrow 0$. The error estimates are derived by energy and semigroup methods combined with a parabolic duality argument.
Stabilizing Peer-to-Peer Spatial Filters
Authors: Silvia Bianchi, Ajoy Datta, Pascal Felber, Maria Gradinariu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information. DR-tree copes with nodes dynamicity (frequent joins and leaves) and memory and counter program corruptions, that is, the processes can connect/disconnect at any time, and their memories and programs can be corrupted. The maintenance of the structure is local and requires no additional memory to guarantee its stabilization. The structure is balanced and is of height O(logm(N)), which makes it suitable for performing efficient data storage or search. We extend our overlay in order to support complex content-based filtering in publish/subscribe systems. Publish/ subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion in distributed networks. Developing efficient publish/subscribe schemes in dynamic distributed systems is still an open problem for complex subscriptions (spanning multi-dimensional intervals). Embedding a publish/ subscribe system in a DR-trees is a new and viable solution. The DR-tree overlay also guarantees subscription and publication times logarithmic in the size of the network while keeping its space requirement low (comparable to its DHT-based counterparts). Nonetheless, the DRtree overlay helps in eliminating the false negatives and drastically reduces the false positives in the embedded publish/ subscribe system.
Optimal initial structure of the RBF networks using time-frequency localization and genetic algorithm
Authors: Seong-Joo Kim, Jong-Soo Kim, Jae-Yong Seo, Hyun-Chan Cho, Hong-Tae Jeon
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper, we propose the initial optimized structure of radial basis function networks that is simple and rapidly converges. We construct the hidden node with radial basis functions; their localization is similar to an approximation target function in the plane of time and frequency. We finally make a good decision for the initial structure for function approximation using a genetic algorithm.
Diagnosing and correcting system anomalies with a robust classifier
Authors: J. Subrahmonia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

If a robust statistical model has been developed to classify the "health" of a system, a well-known Taylor series approximation technique forms the basis of a diagnostic/recovery procedure that can be initiated when the system's health degrades or fails altogether. This procedure determines a ranked set of probable causes for the degraded health state, which can be used as a prioritized checklist for isolating system anomalies and quantifying corrective action. The diagnostic/recovery procedure is applicable to any classifier known to be robust; it can be applied to both neural network and traditional parametric pattern classifiers generated by a supervised learning procedure in which an empirical risk/benefit measure is optimized. We describe the procedure mathematically and demonstrate its ability to detect and diagnose the cause(s) of faults in NASA's Deep Space Communications Complex at Goldstone, California.
Lightweight Risk Mitigation for Software Development Projects Using Repository Mining
Authors: Stephen P. Masticola
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Many software projects fail to deliver their needed results on-time and on-budget. There are a variety of reasons why this may occur. For some of these reasons (notably deterioration of the codebase), corrective action is often difficult to cost-justify or to implement efficiently in practice. To address this, an approach of lightweight risk mitigation is proposed: mine risk data from configuration management and defect tracking systems, integrate this data with project-cost data in a flexible dashboard, and facilitate strategic refactoring with semi-custom transforms where necessary. This prescriptive information would simultaneously help the project manager to cost-justify repair efforts and lowers the cost of finding and fixing hot spots.
Integrated Data Reorganization and Disk Mapping for Reducing Disk Energy Consumption
Authors: Seung Woo Son, Mahmut Kandemir
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Increasing power consumption of high-performance sys- tems leads to reliability, survivability, and cooling related problems. Motivated by this observation, several recent ef- forts focused on reducing disk power consumption through hardware, OS and compiler based techniques. This paper presents a novel approach to reducing disk power consump- tion of large-scale, array-intensive scientific applications. It proposes and evaluates a compiler-based approach that employs two complementary techniques: data reorganiza- tion and disk mapping. The first of these, data reorga- nization, determines a suitable layout for data in the ar- ray space, whereas the second technique, disk mapping, decides the corresponding layout in the disk space. The goal of data reorganization and disk mapping is to ensure that data (from the different disk-resident arrays) that are accessed within the same loop iteration are colocated in the same set of disks. In this way, we can increase disk inter-access times (idle periods of disks) and this in turn al- lows better exploitation of the underlying hardware mech- anisms used for reducing power. Our experiments with eight disk I/O-intensive scientific applications indicate that the proposed approach brings significant reductions in en- ergy consumption, whether the underlying disk system uses spin-down disks or speed-reduced disks, two previously- proposed hardware-based disk power reduction schemes. The results also show that both the components of our scheme (data reorganization and disk mapping) are very important since applying any of these components alone does not generate large savings for most of our applica- tions.
Comparing semantic registries: OWLJessKB and InstanceStore
Authors: Simone A. Ludwig, Omer F. Rana
Venue: Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches (2007)

Service discovery is a critical task in distributed computing architectures for finding a particular service instance. Semantic annotations of services help to enrich the service discovery process. Semantic registries are an important component for the discovery of services and they allow for semantic interoperability through ontology-based query formulation and dynamic mapping of terminologies between system domains. This paper evaluates two semantic registries -- OWLJessKB implementation and instanceStore -- to determine the suitability of these with regards to the performance of loading ontologies, the query response time and the overall scalability for use in mathematical services.
Merging Multiple Lists in O(log n) Time
Authors: Zhaofang Wen
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

The problem of merging k (k \geqslant 2) sorted lists is considered. We give an optimal parallel algorithm which takes O\left( {\frac{{n\log k}} {p} + \log n} \right) time using p processors on the CREW PRAM, where n is the total size of the input lists. The algorithm can be seen as a unified algorithm for parallel sorting and merging. To obtain this algorithm, interesting techniques for designing algorithms are also discussed, including a new processor assignment strategy.
Feasibility of a flip chip approach to integrate an IR filter and an IR detector in a future gas detection cell
Authors: L. Fonseca, E. Cabruja, C. Calaza, R. Rubio, J. Santander, E. Figueras, I. Gracia, C. Cane
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

In this work we have studied the feasibility of integrating an IR filter and IR detector by means of a flip chip technique. This filter and detector combination should be the heart of a future gas detection cell based on infrared absorption. In our case the filter is a surface micromachined Fabry-Perot interferometer, and the IR detector is a bulk micromachined thermopile.
A prototype distance learning laboratory for image processing education
Authors: R. H. Bamberger
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The results of the first year of an NSF-funded image processing distance learning project are described. The project addresses methods to deliver courses over boundaries of time and space where at least one laboratory component required for the project is too costly for an individual student. Hence, the challenge is to deliver distance learning in a fashion that does not financially disenfranchise students and simultaneously does not give distant students a less complete educational experience. To meet this challenge, we have developed new media-rich communication tools (which are accessible via the Internet and the WWW, allowing students to easily exchange media-rich documents), a client-server based interface (which we call WebKHOROS) to KHOROS (a powerful image processing system), and several other components.
Electronic test solutions for FlowFET fluidic arrays
Authors: H. G. Kerkhoff, M. Acar
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The testable design and test of a software-controllable lab-on-a-chip, including a fluidic array of FlowFETs, control and interface electronics is presented. Test hardware is included for detecting faults in the DMOS electro-fluidic interface and the digital parts. Multi-domain fault modelling and simulation shows the effects of faults in the (combined) fluidic and electrical parts. Fault simulations also reveal important parameters of multi-domain test-stimuli for detecting both electrical and fluidic defects.
A note on two-valued possibility (σ-maxitive) measures and Mesiar's hypothesis
Authors: Paul Poncet
Venue: Fuzzy Sets and Systems (2007)

This paper proposes to reformulate Mesiar's hypothesis [Possibility measures, integration and fuzzy possibility measures, Fuzzy Sets and Systems 92 (1997) 191-196], which as such was shown to be untrue by Murofushi [Two-valued possibility measures induced by @s-finite @s-additive measures, Fuzzy Sets and Systems 126 (2002) 265-268]. We prove that a two-valued @s-maxitive measure can be induced by a @s-additive measure under the additional condition that it is localizable.
Towards a genetic algorithms approach to designing 3D polygonal tree models
Authors: P. Layzell, C. Bates Congdon
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The OpenGL graphics libraries (http://www.opengl.org) provide a powerful environment for programming three-dimensional virtual worlds, and are used in a wide variety of applications. However, the creation of individual 3D models to include within a virtual world is an arduous and time-consuming process. We have designed GenTree, an interactive system that uses genetic algorithms to evolve 3D tree models to be used in virtual environments. The system evolves a set of parameters used to render the trees, with a fitness function provided by user input. The initial system works with a modest set of parameters and uses relatively crude rectangles for rendering, but is able to evolve a variety of plant shapes, including deciduous trees, evergreens, and shrubbery.
The use of dynamically reconfigurable protocol stacks for streaming multimedia to mobile devices
Authors: K. Curran, G. Parr
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Traditional protocol stacks can lead to a performance bottleneck due to the insufficient processing power and memory of portable devices. Micro-protocols attempt to eradicate this bottleneck by optimising the protocol stack to the functionality that is actually required by the application. Multicast media groups overcome the heterogeneous client problem where clients subscribe to different quality of services in accordance with resource availability and move between groups according to bandwidth availability. Chameleon is 100% Java middleware for multimedia streaming to heterogeneous mobile clients, which allows the dynamic configuration of protocols with respect to application requirements and available network resources. We evaluate the dynamic reconfigurability of the middleware in order to demonstrate runtime adaptation. We especially concentrate on the secondary quality transformation technique (SQT) of the middleware which enables clients to not only subscribe to media groups in accordance with available resources and network capacity but to also adapt media quality within each quality group dynamically in accordance to resource constraints.
Secure untrusted data repository (SUNDR)
Authors: Jinyuan Li, Maxwell Krohn, David Mazières, Dennis Shasha
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

SUNDR is a network file system designed to store data securely on untrusted servers. SUNDR lets clients detect any attempts at unauthorized file modification by malicious server operators or users. SUNDR's protocol achieves a property called fork consistency, which guarantees that clients can detect any integrity or consistency failures as long as they see each other's file modifications. An implementation is described that performs comparably with NFS (sometimes better and sometimes worse), while offering significantly stronger security.
Prediction of grinding power and surface finish - a GA-fuzzy approach: Short Contribution
Authors: Arup Kumar Nandi, Dilip Kumar Pratihar, Mihir Kumar Banerjee
Venue: Integrated Computer-Aided Engineering (2004)

Grinding, a complex surface finishing process, is used to generate a smooth surface on the job using a wheel. Several analytical and empirical expressions had been developed by various investigators to determine input-output relationships in grinding, which are highly non-linear, and those relationships may not be accurate. In the present work, power requirement and surface finish in grinding are expressed as the functions of three inputs, namely RPM of the job, RPM of the wheel and feed rate, and this process is modeled using a combined GA-Fuzzy approach. An optimized knowledge base (KB) of the fuzzy logic controller (FLC), which is the representative of the KB of a grinding machine, is obtained off-line, using a genetic algorithm (GA). The training data for the FLC is obtained from the empirical expressions (which are generally inaccurate) and the performance of the trained FLC is tested by comparing its results with those obtained through real experiments.
Sampling of information goods
Authors: Chong (Alex) Wang, Xiaoquan (Michael) Zhang
Venue: Proceedings of the ninth international conference on Electronic commerce (2007)

With the development of information technology and the emergence of electronic market places, great business opportunities are created with reduced spatial restraints, lowered search costs, and increased diversity. Marketing practitioners have long been seeking ways to take advantage of the burgeoning technologies. As one of the most commonly utilized marketing tools, free sampling also has its online presence, especially for information goods that can be digitalized with ease nowadays. However, despite its wide adoption, free sampling has attracted little attention. In this article, we provide an analytical model to study the economic rationale behind free samples. We argue that with the development of computer technologies, even a less sophisticated Internet user can be an information provider nowadays. As a result, a "free sample" is less and less under control of a seller. In the context of our analytical framework, we find that this trend does not always hurt the seller. On the contrary, under certain circumstances, the monopolistic seller can be better off with the presence of the free samples provided by third parties. We further include advertising into our model. Based on our analysis, we argue that the decreasing search costs for free samples threaten the effectiveness of advertising.
Motion Planning System for Minimally Invasive Surgery
Authors: Hanees Haniffa, Jerzy Rozenblit, Jianfeng Peng, Allan Hamilton, Mohamad Salkini
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Minimally invasive procedures are highly effective when performed by well trained surgeons. However, with the subjective nature of surgical training and performance assessment, it is difficult to determine when a trainee surgeon has attained a satisfactory level of competency. We propose a computer-based training and performance assessment system where we apply configuration space based techniques to determine optimal paths for the maneuver of surgical instruments to perform predefined tasks.
Speckle Simulation Based on B-Mode Echographic Image Acquisition Model
Authors: Charles Perreault, Marie-Flavie Auclair-Fortier
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper introduces a novel method to simulate Bmode medical ultrasound speckle in synthetic images. Our approach takes into account both the ultrasound image formation model and the speckle formation model. The algorithm first modifies the geometry of an ideal noiseless image to match that of a sectoral B-mode ultrasonogram, by subsampling a grid of pixels to simulate the acquisition and quantization steps of image formation. Then, speckle is added by simulating a random walk in the plane of the complex amplitude, according to the Burckhardt speckle formation model. We finally interpolate the noisy subsampled pixels in order to fill the space introduced by the sampling step and recover a complete image, as would a real ultrasonograph. Synthetic speckle images generated by this method are visually and theoritically very close to real ultrasonograms.
Web Acceptance Model (WAM): Moderating effects of user experience
Authors: J. Alberto Castañeda, Francisco Muñoz-Leiva, Teodoro Luque
Venue: Information and Management (2007)

Our study empirically examined how Davis's Technology Acceptance Model (TAM) helped managers predict a user's intention to revisit a website and how this changed over time as a user gained experience of the Internet and the website. The user's experience of the website played a moderating role. For less experienced users, perceived ease of use was found to be a more important factor in deciding to revisit the website, whereas perceived usefulness had more effect on more experienced users. Thus, web designers can identify and remove web factors that hinder user acceptance and address underlying obstacles to post-adoption usage. The novelty of the study consisted in applying TAM to a free-content website while considering the moderating effects of Internet and website experience. Significant practical implications can be derived from the results.