ppxscal/embedding_network huggingface dataset:
Next generation data management in enterprise application platforms
Authors: Vishal Sikka
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

As a leading provider of applications and application infrastructure software, SAP has been always interested in the entire spectrum of enterprise data management from transactional to analytical, structured and unstructured, as well as high-volatility event data streams. The underlying architecture for enterprise applications has fundamentally changed in the last decade, with the adoption of service-oriented architectures representing the latest shift. However, DBMS architecture has not evolved sufficiently to meet the challenges that these new application characteristics pose. As a result, at SAP we have been rethinking the way enterprise applications manage their data. In this talk, we will present some key aspects of this rethinking. We will start with a description of the shift in application architecture and the challenges that this shift poses on data management. We will then describe the failings of a single overarching DBMS architecture against these needs, and then describe some examples of usage-specific data management in enterprise application platforms. In particular we will focus on our approach to managing analytical, transactional and master data. We will present some results that describe how, with a combination of better utilization of main-memory based data management techniques, addressing the needs of the next generation application infrastructure and advances in the underlying computing and storage infrastructure, we can do significantly more efficient data management.
6TO4 versus TUNNELBROKERS
Authors: Carlos Friacas, Miguel Baptista, Monica Domingues, Paulo Ferreira
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Transition mechanisms are a continuous topic/subset of IPv6 work at a global level. There is a big diversity of mechanisms, however this document is focusing mainly on two of them. It shows the positive usage of one of them and stresses reasons why the other should not be a priority nor used at a wide scale.
An Artificial Immune System Model for Multi Agents based Resource Discovery in Distributed Environments
Authors: Ki-Won Yeom, Ji-Hyung Park
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

From the point of view of information technology the immune system is a highly parallel and distributed intelligent system which has learning, memory, and associative capabilities. Artificial Immune System is a novel evolutionary paradigm inspired by the biological aspects of the immune system of mammals. The human immune system has motivated scientists and engineers for finding powerful information processing algorithms that has solved complex engineering tasks. This paper discusses the behavioral maNAement of artificial intelligence namely the intelligent multi agent systems, and the evolutionary computation called the artificial immune system that imitates the biological theory called the immune system. We present how two concepts from the talk are fused into an artificial intelligent agent system for detecting resources in distributed computing environments and examine how our model can be applied and show that the model can solve an intricate problem successfully through the simulation.
Joint Time and Frequency Analysis for Light Pulses in the Presence of Third Order Dispersion in Optical Fibers
Authors: Zhonglei Mei
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Join time-frequency analysis method (JTFA), specifically the Wigner-Ville Distribution, is employed to analyze chirped and unchirped Gaussian pulses in optical fibers with third order dispersion(TOD). WVD evolution along the fiber is given and in good agreement with the data obtained by the traditional time or frequency domain method. The relationship between the initial chirp parameter, TOD, second order dispersion (SOD) and the WVD is also given. The proposed method can better demonstrate energy distribution of the signal in both the time domain and frequency domain and gives more information about the signal; it has potential applications in the optical fiber communication field.
Focussing on a standard pattern form: the development and evaluation of MUIP
Authors: Junhua Deng, Elizabeth Kemp, Elisabeth G. Todd
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

A framework for the tool, MUIP (Management of User Interface Patterns), has been developed based on the relevant literature and a survey of existing pattern tools. The framework supports the following features: pattern authoring, manipulating forces, browsing patterns, searching patterns, versioning and customising patterns, relating patterns, manipulating collections and importing or exporting patterns. Patterns are described using the standard pattern form (PLML). An enhanced version of PLML, called PLML vl.2, has been developed so that pattern contents can be organised more effectively. Guided by this framework, a specification of a comprehensive pattern management system for manipulating dissimilar pattern collections was developed and a prototype implemented accordingly. A formal evaluation confirmed the usefulness of the prototype.
Stigmergic approaches applied to flexible fault-tolerant digital VLSI architectures
Authors: Danilo Pani, Luigi Raffo
Venue: Journal of Parallel and Distributed Computing (2006)

Parallel implementations are widely used in digital architectures to enhance computational performances, exploiting the number of involved processing units. Cooperative behaviors typical of swarm intelligence can enhance the performances of such systems introducing an amplification effect due to the collective effort of a set of interacting hardware agents. Cooperation can also be exploited like a new weapon to achieve the fault-tolerance goal, with no need for expressly inserted redundant hardware resources. In this paper we present a novel architecture able to address these issues exploiting all the potentiality exposed by this bioinspired approach. A first implementation on CMOS 0.13 µm technology shows the feasibility of such a design style, allowing preliminary simulations and discussions.
The use of multiple choice tests for formative and summative assessment
Authors: Tim S. Roberts
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

This paper describes the use of multiple-choice tests as an essential part of the assessment for a third-year undergraduate course in computer science. Multiple-choice tests are yesterday's news - they have been used for student assessment for many years - but their implementation as presented here differs from the norm in several important respects, in particular their use for formative (as opposed to purely summative) reasons. This paper describes the intent of the tests, their format, and the regulations concerning them, discusses the advantages and disadvantages, and concludes that there are significant gains to be made for both educators and students from their appropriate deployment.
Tips for successful practice of simulation
Authors: Deborah A. Sadowski
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Succeeding with a technology as powerful as simulation involves much more than the technical aspects you may have been trained in. The parts of a simulation study that are outside the realm of modeling and analysis can make or break the project. This paper explores the most common pitfalls in performing simulation studies and identifies approaches for avoiding these problems.
Faster fixed parameter tractable algorithms for finding feedback vertex sets
Authors: Venkatesh Raman, Saket Saurabh, C. R. Subramanian
Venue: ACM Transactions on Algorithms (TALG) (2006)

A feedback vertex set (fvs) of a graph is a set of vertices whose removal results in an acyclic graph. We show that if an undirected graph on n vertices with minimum degree at least 3 has a fvs on at most 1/3n1 &minus; &epsi; vertices, then there is a cycle of length at most 6/&epsi; (for &epsi; &ge; 1/2, we can even improve this to just 6).Using this, we obtain a O((12 log k/log log k &plus; 6)k n&omega; algorithm for testing whether an undirected graph on n vertices has a fvs of size at most k. Here n&omega; is the complexity of the best matrix multiplication algorithm. The previous best parameterized algorithm for this problem took O((2k &plus; 1)kn2) time.We also investigate the fixed parameter complexity of weighted feedback vertex set problem in weighted undirected graphs.
Identifying film takes for cinematic analysis
Authors: B. T. Truong, S. Venkatesh, C. Dorai
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we focus on the 'reverse editing' problem in movie analysis, i.e., the extraction of film takes, original camera shots that a film editor extracts and arranges to produce a finished scene. The ability to disassemble final scenes and shots into takes is essential for nonlinear browsing, content annotation and the extraction of higher order cinematic constructs from film. In this work, we investigate agglomerative hierarchical clustering methods along with different similarity metrics and group distances for this task, and demonstrate our findings with 10 movies.
Mechanising λ-calculus using a classical first order theory of terms with permutations
Authors: Michael Norrish
Venue: Higher-Order and Symbolic Computation (2006)

This paper describes the mechanisation in HOL of some basic ¿-calculus theory. The proofs are taken from standard sources (books by Hankin and Barendregt), and cover: equational theory, reduction theory, residuals, finiteness of developments, and the standardisation theorem. The issues in mechanising pen-and-paper proofs are discussed; in particular, those difficulties arising from the sources' use of the Barendregt Variable Convention.
Multimedia content distribution in hybrid wireless networks using weighted clustering
Authors: Adrian Andronache, Matthias R. Brust, Steffen Rothkugel
Venue: Proceedings of the 2nd ACM international workshop on Wireless multimedia networking and performance modeling (2006)

Fixed infrastructured networks naturally support centralized approaches for group management and information provisioning. Contrary to infrastructured networks, in multi-hop ad-hoc networks each node acts as a router as well as sender and receiver. Some applications, however, requires hierarchical arrangements that¿for practical reasons¿has to be done locally and self-organized. An additional challenge is to deal with mobility that causes permanent network partitioning and reorganizations. Technically, these problems can be tackled by providing additional uplinks to a backbone network, which can be used to access resources in the Internet as well as to inter-link multiple ad-hoc network partitions, creating a hybrid wireless network. In this paper, we present a prototypically implemented hybrid wireless network system optimized for multimedia content distribution. To efficiently manage the ad-hoc communicating devices a weighted clustering algorithm is introduced. The proposed localized algorithm deals with mobility, but does not require geographical information or distances
Unifying Different Users' Interpretations and Levels of Abstraction for Improving Annotation-based Image Retrieval
Authors: Johanna Vompras, Stefan Conrad
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

The proceeding application of multimedia information systems has brought the need for developing efficient querying and browsing methods for large image repositories. One solution to overcome the semantic gap between low-level visual features of images and high-level human perception is to generate semantic annotations for images to describe their contents. Therefore, the broad variety and the lack of standards among different annotation tools make it necessary to develop an annotation model supporting the unification and integration of different annotations created by users having different background knowledge. In this paper we present a multi-level annotation model which considers the several levels of abstractions at which content descriptions are assigned and we show how it can be utilized in sophisticated retrieval systems to support image retrieval at the semantic level.
Design Analysis of a High-Resolution Panoramic Camera Using Conventional Imagers and a Mirror Pyramid
Authors: Hong Hua, Narendra Ahuja, Chunyu Gao
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Wide field of view (FOV) and high-resolution image acquisition is highly desirable in many vision-based applications. Several systems have reported the use of reflections off mirror pyramids to capture high-resolution, single-viewpoint, and wide-FOV images. Using a dual mirror pyramid (DMP) panoramic camera as an example, in this paper, we examine how the pyramid geometry, and the selection and placement of imager clusters can be optimized to maximize the overall panoramic FOV, sensor utilization efficiency, and image uniformity. The analysis can be generalized and applied to other pyramid-based designs.
Cyclic-mean based synchronization and efficient demodulation for UWB ad hoc access: generalizations and comparisons
Authors: Xiliang Luo, Georgios B. Giannakis
Venue: Signal Processing (2006)

Synchronization is a performance-critical factor in all communication systems, but becomes particularly challenging in ultra-wideband (UWB) radios due to the ultra-short length of the transmitted pulses. Presence of severe inter-symbol interference (ISI) and multi-user interference (MUI) render the synchronization task even more difficult. The present paper deals with a blind synchronization and demodulation scheme which relies on intermittent transmission of nonzero mean symbols. This transmission pattern enables MUI- and ISI-resilient timing acquisition via energy detection and low-complexity demodulation by correlating the received waveform with a synchronized aggregate template (SAT). The resultant SAT receiver offers distinct advantages over the traditional RAKE and has remarkably low-complexity. Its blind operation nicely fits the requirements of multi-user ad hoc access and its ability to handle ISI is particularly attractive for UWB communications. Analytical performance evaluation of the novel timing estimator and the SAT demodulator is provided along with comparisons with the RAKE receiver for a single user link without ISI. Simulations confirm the analytical results and corroborate the high potential SAT-based UWB modems have for deployment.
Adaptation of memory depth in the gamma filter
Authors: Jyh-Ming Kuo, S. Celebi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Gamma filters are a special class of generalized feedforward filters where feedbacks are allowed only locally. The authors present the conditions for the selection of optimal parameters which are the weights and the memory depth of the filter. The conditions for these two set of parameters are decoupled from each other. This allows a matched filter implementation which gives an estimate of the memory depth.
Integrating parallel interactions into cooperative search
Authors: Efrat Manisterski, David Sarne, Sarit Kraus
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the currently used ones. As a framework for our analysis we use the electronic marketplace, where buyer agents have the incentive to search cooperatively. The new search technique is quite intuitive, however its analysis and the process of extracting the optimal search strategy are associated with several significant complexities. These difficulties are derived mainly from the unbounded search space and simultaneous dual affects of decisions taken in different world states. We provide a comprehensive analysis of the model, highlighting, demonstrating and proving important characteristics of the optimal search strategy. Consequently, we manage to come up with an efficient modular algorithm for extracting the optimal cooperative search strategy for any given environment. A computational based comparative illustration of the system performance using the new search technique versus the traditional methods is given, emphasizing the main differences in the optimal strategy's structure and the advantage of using the proposed model.
Dimensionality Reduction by Learning an Invariant Mapping
Authors: Raia Hadsell, Sumit Chopra, Yann LeCun
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that 'similar" points in input space are mapped to nearby points on the manifold. We present a method - called Dimensionality Reduction by Learning an Invariant Mapping (DrLIM) - for learning a globally coherent nonlinear function that maps the data evenly to the output manifold. The learning relies solely on neighborhood relationships and does not require any distancemeasure in the input space. The method can learn mappings that are invariant to certain transformations of the inputs, as is demonstrated with a number of experiments. Comparisons are made to other techniques, in particular LLE.
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy
Authors: Iannis Tourlakis
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

Lovasz and Schrijver [13] defined three progressively stronger procedures LS0, LS and LS+, for systematically tightening linear relaxations over many rounds. All three procedures yield the integral hull after at most n rounds. On the other hand, constant rounds of LS_+ can derive the relaxations behind many famous approximation algorithms such as those for MAX-CUT, SPARSEST-CUT. So proving round lower bounds for these procedures on specific problems may give evidence about inapproximability. We prove new round lower bounds for VERTEX COVER in the LS hierarchy. Arora et al. [3] showed that the integrality gap for VERTEX COVER relaxations remains 2.o(1) even after \Omega(log n) rounds LS. However, their method can only prove round lower bounds as large as the girth of the input graph, which is O(log n) for interesting graphs. We break through this "girth barrier" and show that the integrality gap for VERTEX COVER remains 1.5 . \in even after \Omega(log^2 n) rounds of LS. In contrast, the best PCPbased results only rule out 1.36-approximations. Moreover, we conjecture that the new technique we introduce to prove our lower bound, the "fence" method, may lead to linear or nearly linear LS round lower bounds for VERTEX COVER.
Evaluating the Impact of Fault Recovery on Superscalar Processor Performance
Authors: Toshinori Sato, Akihiro Chiyonobu
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Current semiconductor technologies have become susceptible to high-energy neutrons from space. Following the trends in smaller transistors, lower supply voltage, and higher clock frequency, current microprocessors are susceptible to soft errors, which constitute the vast majority of hardware failures. Based on these trends, it is expected that the quality with respect to reliability becomes important as well as performance for microprocessors. In light of this, a lot of fault-tolerance microarchitectures are recently proposed (see Section 2 in [1]). These studies mainly focus on detecting transient faults, and hence almost every previous study evaluated processor performance in the absence of faults. This analysis only presents the performance impact of constraints introduced by fault detection mechanism. While several papers propose fault recovery mechanisms, only a few evaluated their impact on performance [2, 3]. One of the reasons why this evaluation methodology is widely selected is that faults are expected to be rare enough that the overall performance will be determined by fault-free behavior. However, evaluating recovery cost of fault tolerant execution is also important, because it is predicted that transient hardware faults occur more frequently as semiconductor technology is improved. Therefore, this paper focuses on recovery from faults.
Introducing MDA in a large IT consultancy organization
Authors: Vinay Kulkarni, Sreedhar Reddy
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

We discuss our experience of introducing MDA approach, supported by our MDA toolset, in an IT consultancy and software development services organization. Initially, our MDA toolset provided a set of modeling notations for specifying different layers of an enterprise application and a set of code generators that transform these models into platform-specific implementations. In spite of considerable amount of code being generated, it didn't translate into commensurate productivity gain over the entire development lifecycle of large projects. What was missing was support for collaborative development. Providing suitable abstractions and tool support for a collaboration-based development method improved the situation considerably. Enterprise product lines and large development projects benefited the most resulting in improved productivity, better code quality, platform independence and easier change management. However, the steep learning curve and inadequate debugging support for models were significant hurdles. Small to medium sized projects found this MDA approach too heavy and restrictive, and preferred a flexible and lightweight meta-data driven aspect-oriented approach. Our experience suggests that MDA will find greater acceptance if complimented with well-defined and flexible methodologies that support collaborative development.
PathBank: Web-Based Querying and Visualziation of an Integrated Biological Pathway Database
Authors: Joshua Wing Kei Ho, Tristan Manwaring, Seok-Hee Hong, Uwe Roehm, David Cho Yau Fung, Kai Xu, Tim Kraska, David Hart
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

PathBank is a web-based query and visualization system for biological pathways using an integrated pathway database. To address the needs for biologists to visualize and analyze biological pathways, PathBank is designed to be user-friendly, flexible and extensible. It is, to the best of our knowledge, the first web-based system that allows biological pathways to be visualized in three dimensions. PathBank demonstrates the ability to automatically generate and layout biological pathways in response to webbased database query about proteins, genes, gene ontology and small molecules. Using a novel OWL-to-relational database schema generation approach, it can automatically integrate biological data from different sources that support the BioPAX exchange format (e.g. KEGG, Bio- Cyc). The systems web interface allows both simple keyword and complex query-based searches in the database. The pathway visualization component provides fast and interactive data access by using asynchronous data retrieval. Due to its modular implementation, it can be easily extended with new visualization algorithms.