ppxscal/embedding_network huggingface dataset:
Supporting Dynamic Software Tool Integration via Web Service-Based Components
Authors: Nelson Yap, Hau Chean Chiong, John Grundy, Rebecca Berrigan
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Most software engineering tools come with fixed functionality or limited plug-in extension capabilities. Building software development environments that support truly dynamic extension capabilities to incorporate a wide range of additional facilities at run-time has proved to be a very challenging task. We describe a new approach using web service components to support the dynamic discovery, integration and invocation of remote software tool facilities for JEdit, an open source Integrated Development Environment. In this approach discrete software tool functionality is encapsulated in software "toolets", accessed as remote web service-based components. These toolet services are registered and discovered, and then dynamically integrated and invoked from within the JEdit IDE as required. We describe the architecture of our approach, key design and implementation issues, and illustrate the feasibility of the approach with several prototype toolet components and results of their evaluation.
Effective C++: 55 Specific Ways to Improve Your Programs and Designs (3rd Edition)
Authors: Scott Meyers
Venue:  (2005)

“Every C++ professional needs a copy of Effective C++. It is an absolute must-read for anyone thinking of doing serious C++ development. If you've never read Effective C++ and you think you know everything about C++, think again.” - Steve Schirripa, Software Engineer, Google “C++ and the C++ community have grown up in the last fifteen years, and the third edition of Effective C++ reflects this. The clear and precise style of the book is evidence of Scott's deep insight and distinctive ability to impart knowledge.” - Gerhard Kreuzer, Research and Development Engineer, Siemens AGThe first two editions of Effective C++ were embraced by hundreds of thousands of programmers worldwide. The reason is clear: Scott Meyers' practical approach to C++ describes the rules of thumb used by the experts - the things they almost always do or almost always avoid doing - to produce clear, correct, efficient code.The book is organized around 55 specific guidelines, each of which describes a way to write better C++. Each is backed by concrete examples. For this third edition, more than half the content is new, including added chapters on managing resources and using templates. Topics from the second edition have been extensively revised to reflect modern design considerations, including exceptions, design patterns, and multithreading.Important features of Effective C++ include: Expert guidance on the design of effective classes, functions, templates, and inheritance hierarchies. Applications of new “TR1” standard library functionality, along with comparisons to existing standard library components. Insights into differences between C++ and other languages (e.g., Java, C#, C) that help developers from those languages assimilate “the C++ way” of doing things.
Semantic case role detection for information extraction
Authors: Rik De Busser, Roxana Angheluta, Marie-Francine Moens
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

If information extraction wants to make its results more accurate, it will have to resort increasingly to a coherent implementation of natural language semantics. In this paper, we will focus on the extraction of semantic case roles from texts. After setting the essential theoretical framework, we will argue that it is possible to detect case roles on the basis of morphosyntactic and lexical surface phenomena. We will give a concise overview of our methodology and of a preliminary test that seems to confirm our hypotheses.
Criteria for exponential stability of Cohen-Grossberg neural networks
Authors: Xiaofeng Liao, Chunguang Li, Kwok-Wo Wong
Venue: Neural Networks (2004)

In this paper, the Cohen-Grossberg neural network models without and with time delays are considered. By constructing several novel Lyapunov functionals, some sufficient criteria for the existence of a unique equilibrium and global exponential stability of the network are derived. These results are fairly general and can be easily verified. Besides, the approach of the analysis allows one to consider different types of activation functions, including piecewise linear, sigmoids with bounded activations as well as C1 -smooth sigmoids. In the meantime, our approach does not require any symmetric assumption of the connection matrix. It is believed that these results are significant and useful for the design and applications of the Cohen-Grossberg model.
Efficient Image Matching with Distributions of Local Invariant Features
Authors: Kristen Grauman, Trevor Darrell
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature setsý similarity via a voting scheme (which ignores co-occurrence statistics) or by comparing histograms over a set of prototypes (which must be found by clustering). We present a method for efficiently comparing images based on their discrete distributions (bags) of distinctive local invariant features, without clustering descriptors. Similarity between images is measured with an approximation of the Earth Moverýs Distance (EMD), which quickly computes minimal-cost correspondences between two bags of features. Each imageýs feature distribution is mapped into a normed space with a low-distortion embedding of EMD. Examples most similar to a novel query image are retrieved in time sublinear in the number of examples via approximate nearest neighbor search in the embedded space. We evaluate our method with scene, object, and texture recognition tasks.
Formulating the Architectural Design of Enterprise Applications as a Search Problem
Authors: Tariq Al-Naeem, Feras T. Dabous, Fethi A. Rabhi, Boualem Benatallah
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Software architecture design is widely recognized to be a complex task. This is especially true when designing enterprise applications that require deciding about a number of architectural design issues, often involving selecting among various design alternatives that impact differently on a set of quality attributes. In order to facilitate the selection process, earlier research efforts have already investigated the use of quantitative decision-making methods for scoring and ranking design alternatives. These methods, however, treat individual architectural decisions independently without considering their synergistic inter-relationships. We argue that many architectural decisions are highly interdependent with each other, and thus need to be treated jointly in the selection process. To support this claim, we have identified two types of dependencies that can occur among different design decisions. We show that in particular situations, these dependencies require employing unconventional methods in determining the appropriate design solution. For this purpose, we suggest formulating the architectural design task as a search problem, and also show how search trees can be useful in this regard. We apply these ideas on a financial system, in order to demonstrate their applicability in a real setting.
Toward cooperative genomic knowledge inference
Authors: Chain-Wu Lee, Chun-Hsi Huang
Venue: Parallel Computing (2004)

This paper proposes an efficient infrastructure for distributed genomic knowledge reasoning. A genomic semantic network complying with the UMLS is used as backbone knowledge representation system.
DIGIMIMIR: A Tool for Rapid Situation Analysis of Helpdesk and Support Email
Authors: Nils Einar Eide, Andreas N. Blaafadt, Baard H. Rehn Johansen, Frode Eika Sandnes
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

The system administrators of large organizations often receive a large number of e-mails from its users and a substantial amount of effort is devoted to reading and responding to these e-mails. The content of these messages can range from trivial technical questions to complex problem reports. Often these queries can be classified into specific categories, for example reports of a file-system that is full or requests to change the toner in a particular printer. In this project we have experimented with text-mining techniques and developed a tool for automatically classifying user e-mail queries in real-time and pseudo-automatically responding to these requests. Our experimental evaluations suggest that one cannot completely rely on a totally automatic tool for sorting and responding to incoming e-mail. However, it can be a resource-saving compliment to an existing toolset that can increase the support efficiency and quality.
Clustering method for fast deformation with constraints
Authors: Jin Huang, Xinguo Liu, Hujun Bao, Baining Guo, Heung-Yeung Shum
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

We present a fast deformation method for flexible objects. The deformation of the object is physically modeled using a linear elasticity model with a displacement based finite elements method, yielding a linear system at each time step of simulation. We solve this linear system using a precomputed force-displacement matrix, which describes the object response in terms of displacement accelerations to the forces acting on each vertex. We exploit the spatial coherence to effectively compress the force-displacement matrix to make this method practical and efficient by applying the clustered principal component analysis method. And we developed a method to efficiently handle the additional constraints for interactive user manipulation. At last large deformations are addressed based upon the compressed force-displacement matrix by combining a domain decomposition method and tracking the rotational motions. The experimental results demonstrate fast performances on complex large scale objects under interactive user manipulations.
Technology-based Architectural Analysis of Operand Bypass Networks for Efficient Operand Transport
Authors: Hongkyu Kim, D. Scott Wills, Linda M. Wills
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

As semiconductor feature sizes decrease, interconnect delay is becoming a dominant component of processor cycle times. This creates a critical need to shift micro-architectural design focus from operation computation to operand transport. Operand bypass networks of out-of-order superscalar processors are particularly demanding of wiring resources. Forwarding path delay has become a limiting factor of processor performance. This paper proposes a novel technology-based methodology to evaluate bypass network configurations by predicting operand transport cost. It combines technology modeling techniques with cycle-accurate simulation of benchmark applications to characterize operand movement and storage requirements. Our analysis shows that the operand transport cost heavily depends on the physical location of functional units (FUs) and instruction steering strategy. We propose a traffic-based placement which places FUs based on the transport distribution pattern; and a geometry-driven instruction steering which tries to assign each pair of dependent instructionsto adjacent computing resources. Performance is evaluated on an aggressive eight-way, 16 functional unit processor operating at 1.9 GHz in 100 nm technology. Combining these two techniques, the IPC penalties resulting from wire delay latency can be kept within 6.8% of the ideal zero bypass delay processor for Spec2000Int and within 5.5% for MediaBench.
Inverse Polarization Raytracing: Estimating Surface Shapes of Transparent Objects
Authors: Daisuke Miyazaki, Katsushi Ikeuchi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose a novel method for estimating the surface shapes of transparent objects by analyzing the polarization state of the light. Existing methods do not fully consider the reflection, refraction, and transmission of the light occurring inside a transparent object. We employ a polarization raytracing method to compute both the path of the light and its polarization state. Our proposed iterative computation method estimates the surface shape of the transparent object by minimizing the difference between the polarization data rendered by the polarization raytracing method and the polarization data obtained from a real object.
Route Recovery Mechanisms for Ad Hoc Networks Equipped with Switched Single Beam Antennas
Authors: Tarun Joshi, Hrishikesh Gossain, Carlos Cordeiro, Dharma P. Agrawal
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

In this paper we propose a novel three phase route recovery mechanism for routing over switched single beam directional antennas. We enhance the popular Dynamic Source Routing (DSR) protocol to the underlying directional layer and include an improved broadcast mechanism to facilitate an efficient route discovery. In the event of a link failure, our optimized directional routing protocol (DRP) proceeds in three phases to recover the route to the destination: (i) antenna beam handoff, (ii) local route recovery and (iii) zonal route recovery. We have compared the performance of DRP with the DSR protocol over both omni-directional and directional antenna models in conditions of varying network mobility. Our results clearly indicate that DRP is robust to link failures even in highly mobile scenarios.
A New Analytic Approach to Evaluation of Packet Error Rate in Wireless Networks
Authors: Ramin Khalili, Kave Salamatian
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Bit Error Rate (BER) and Packet Error Rate (PER) are important Quality of Service Parameters for Wireless network. Most of researches in QoS have been devoted to the analysis of BER which gives insight to the mean behavior of the wireless network. However the mean behavior is not sufficient for PER evaluation and more precise characterization of the error process is needed. Residual errors at the output of physical layer are not uniformly distributed. This is due to error correcting mechanism used at physical layer as well as the correlation induced by the memory existing in fading channels. Not taking into account the correlation in the error process and assuming for example that errors are uniformly distributed, as done in most of the published paper in wireless networking, lead to gross overestimation of PER. This over-estimation can go to tenfold factors as will be shown in this paper. In a previous paper we presented a new analytic formula for predicting Packet Error rate in Wireless networks where convolutional codes are used jointly with Viterbi decoder over an AWGN channel. The approach was based on a precise analysis of the error process at the output of the Viterbi decoder. This formula was shown to precisely predict the PER as a function of convolutional code parameter and SNR over the AWGN channel. In this paper we extend the result obtained for the AWGN channel to the case of fading channel under block fading hypothesis. A closed form formulas approximation for derivation of PER in Fading channel is proposed and it is shown that it give very tight prediction for the PER.
Efficient and flexible architectural support for dynamic monitoring
Authors: Yuanyuan Zhou, Pin Zhou, Feng Qin, Wei Liu, Josep Torrellas
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2005)

Recent impressive performance improvements in computer architecture have not led to significant gains in the case of debugging. Software debugging often relies on inserting run-time software checks. In many cases, however, it is hard to find the root cause of a bug. Moreover, program execution typically slows down significantly, often by 10--100 times.To address this problem, this paper introduces the intelligent watcher (iWatcher), a novel architectural scheme to monitor dynamic execution automatically, flexibly, and with minimal overhead. iWatcher associates program-specified monitoring functions with memory locations. When any such location is accessed, the monitoring function is automatically triggered with low overhead. To further reduce overhead and support rollback, iWatcher can optionally leverage thread-level speculation (TLS). The iWatcher architecture can be used to detect various bugs, including buffer overflow, accessing freed locations, memory leaks, stack-smashing and value-invariant violations. To evaluate iWatcher, we use seven applications with various real and injected bugs. Our results show that iWatcher detects many more software bugs than Valgrind, a well-known open-source bug detector. Moreover, iWatcher only induces a 0.1--179&percent; execution overhead, which is orders of magnitude less than Valgrind. Our sensitivity study shows that even with 20&percent; of the dynamic loads monitored in a program, iWatcher adds only 72--182&percent; overhead. Finally, TLS is effective at reducing overheads for programs with substantial monitoring.
Poisson shape interpolation
Authors: Dong Xu, Hongxin Zhang, Qing Wang, Hujun Bao
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

In this paper, we propose a novel shape interpolation approach based on Poisson equation. We formulate the trajectory problem of shape interpolation as solving Poisson equations defined on a domain mesh. A non-linear gradient field interpolation method is proposed to take both vertex coordinates and surface orientation into account. With proper boundary conditions, the in-between shapes are reconstructed implicitly from the interpolated gradient fields, while traditional methods usually manipulate vertex coordinates directly. Besides of global shape interpolation, our method is also applicable to local shape interpolation, and can be further enhanced by incorporating with deformation. Our approach can generate visual pleasing and physical plausible morphing sequences with stable area and volume changes. Experimental results demonstrate that our technique can avoid the shrinkage problem appeared in linear shape interpolation.
Report of the International Symposium on Component-Based Software Engineering
Authors: Ivica Crnkovic, Ralf Reussner, Heinz Schmidt, Kevin Simons, Judith Stafford, Kurt Wallnau
Venue: ACM SIGSOFT Software Engineering Notes (2005)

The International Symposium on Component-Based Software Engineering (CBSE7) was held at 28th International Conference on Software Engineering in Edinburgh, Scotland, May 24-25, 2004. The Symposium brought together researchers and practitioners from several communities: component technology, composition languages, compositional analysis, software architecture, software certification and scientific computing. The primary goal of the symposium was to continue clarifying the concepts, identifying the main challenges and findings of predictable assembly of software components. This report gives a comprehensive summary of the position papers, of the symposium, its findings, and its results.
New Constructions for IPP Codes
Authors: Tran Van Trung, Sosina Martirosyan
Venue: Designs, Codes and Cryptography (2005)

Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit construction methods for IPP codes by means of recursion techniques. The first method directly constructs IPP codes, whereas the second constructs perfect hash families that are then used to derive IPP codes. In fact, the first construction provides an infinite class of IPP codes having the best known asymptotic behavior. We also prove that this class has a traitor tracing algorithm with a runtime of O(M) in general, where M is the number of codewords.
Navigation Aided Image Processing in UAV Surveillance: Preliminary Results and Design of an Airborne Experimental System
Authors: Jonas Nygårds, Per Skoglar, Morgan Ulvklo, Tomas Högström
Venue: Journal of Robotic Systems (2004)

This paper describes an airborne reconfigurable measurement system being developed at Swedish Defence Research Agency (FOI), Sensor Technology, Sweden. An image processing oriented sensor management architecture for UAV (unmanned aerial vehicles) IR&sol;EO-surveillance is presented. Some preliminary results of navigation aided image processing in UAV applications are demonstrated, such as SLAM (simultaneous localization and mapping), structure from motion and geolocation, target tracking, and detection of moving objects. The design goal of the measurement system is to emulate a UAV-mounted sensor gimbal using a stand-alone system. The minimal configuration of the system consists of a gyro-stabilized gimbal with IR and CCD sensors and an integrated high-performance navigation system. The navigation system combines dGPS real-time kinematics (RTK) data with data from an inertial measurement unit (IMU) mounted with reference to the optical sensors. The gimbal is to be used as an experimental georeferenced sensor platform, using a choice of carriers, to produce military relevant image sequences for studies of image processing and sensor control on moving surveillance and reconnaissance platforms. Furthermore, a high resolution synthetic environment, developed for sensor simulations in the visual and infrared wavelengths, is presented. &copy; 2004 Wiley Periodicals, Inc.
An optimal multi-writer snapshot algorithm
Authors: Prasad Jayanti
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

An m-component, n-process snapshot object is an abstraction of shared memory that consists of m words and allows up to n processes to concurrently execute the following two types of operations: write(i,v), which writes v into the ith word, and scan(), which returns the current values of all m locations [1, 3]. The snapshot problem is to design algorithms for the write and scan operations that meet two challenging requirements: (1) operations appear to be atomic, and (2) operations are wait-freeFor any (m-component, n-process) snapshot algorithm, which runs on hardware that supports only word-sized objects, Ω(1) and Ω(m) are trivial lower bounds on the time complexity of write(i,v) and scan(), respectively. But, are these bounds tight?For a restricted version of the snapshot problem, known in the literature as the single-writer snapshot problem, Riany, Shavit and Touitou [18] showed that the answer is yes: they designed an algorithm with O(1) and O(m) running times for the write(i,v) and scan() operations, respectively. (The single-writer snapshot problem assumes that (i) the number m of words of the snapshot object is equal to the number n of processes, and (ii) only the ith process may write into the ith snapshot word.This paper shows that the same (optimal) running times of O(1) for write(i,v) and O(m) for scan() are achievable for the general problem, known in the literature as the multiwriter snapshot problem. Our algorithm requires hardware support for the CAS (compare&swap) operation (in comparison, Riany, Shavit and Touitou's algorithm requires hardware support for CAS, fetch&inc, and fetch&dec operations).