ppxscal/embedding_network huggingface dataset:
Global Image Search vs. Regional Search in CBIR Systems
Authors: Stevan Rudinac, Marija Uscumlic, Maja Rudinac, Goran Zajic, Branimir Reljin
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

The global image search and regional image search are compared by using content-based image retrieval system with user relevance feedback. It was expectable that regional search can minimize the effect of the background to the image retrieval. Images from database are partitioned into regular rectangular regions: 4x4 non-overlapped (NOV) regions and 3x3 overlapped (OV) regions, and a feature vectors are determined for whole images and for regions. Four CBIR scenarios are considered: global search, search based on 4x4 NOV regions, based on 3x3 OV regions and based on arbitrary cropped part of a query image. System is tested over images from Corel 1K dataset.
Chip Researchers on Brink of Next-Gen Breakthroughs
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

Recent announcements from major chip manufacturers and research labs worldwide indicate that news of the imminent demise of Moore's law might be premature. New technologies, materials, and architectural tweaks are extending its life again.
Information-Aware 2^n-Tree for Efficient Out-of-Core Indexing of Very Large Multidimensional Volumetric Data
Authors: Jusub Kim, Joseph JaJa
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

We discuss a new efficient out-of-core multidimensional indexing structure, information-aware 2n-tree, for indexing very large multidimensional volumetric data. Building a series of (n-1)-Dimensional indexing structures on n-Dimensional data causes a scalability problem in the situation of continually growing resolution in every dimension. However, building a single n-Dimensional indexing structure can cause an indexing effectiveness problem compared to the former case. The information-aware 2n-tree is an effort to maximize the indexing structure efficiency by ensuring that the subdivision of space have as similar coherence as possible along each dimension. It is particularly useful when data distribution along each dimension constantly shows a different degree of coherence from each other dimension. Our preliminary results show that our new tree can achieve higher indexing structure efficiency than previous methods.
Transparent network services via a virtual traffic layer for virtual machines
Authors: John R. Lange, Peter A. Dinda
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

We claim that network services can be transparently added to existing unmodified applications running inside virtual machine environments. Examples of these network services include protocol transformations (e.g. TCP to UDT), network connection persistence during long duration unavailability (e.g. wide area VM migration), and network flow modification (e.g. local acknowledgments and Split-TCP). To demonstrate the utility of this concept, and to enable the practical implementations of these examples and others, we have developed VTL. VTL is a framework for packet modification and creation whose purpose is to modify network traffic to and from a VM, doing so transparently to the VM and its applications. We explain how to use VTL to implement the examples mentioned above and others, such as providing anonymized connectivity for a virtual machine through the Tor anonymizing network, and creating cooperative selective wormholing services for network intrusion detection systems.
DITTO: automatic incrementalization of data structure invariant checks (in Java)
Authors: Ajeet Shankar, Rastislav Bodík
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

We present DITTO, an automatic incrementalizer for dynamic, side-effect-free data structure invariant checks. Incrementalization speeds up the execution of a check by reusing its previous executions, checking the invariant anew only the changed parts of the data structure. DITTO exploits properties specific to the domain of invariant checks to automate and simplify the process without restricting what mutations the program can perform. Our incrementalizer works for modern imperative languages such as Java and C#. It can incrementalize,for example, verification of red-black tree properties and the consistency of the hash code in a hash table bucket. Our source-to-source implementation for Java is automatic, portable, and efficient. DITTO provides speedups on data structures with as few as 100 elements; on larger data structures, its speedups are characteristic of non-automatic incrementalizers: roughly 5-fold at 5,000 elements,and growing linearly with data structure size.
Providing policy control over object operations in a mach based system
Authors: Spencer E. Minear
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

In both secure and safety-critical systems it is desirable to have a very clear relationship between the system's mandatory security policy and its proven operational semantics. This relationship is made clearer if the system architecture provides strong separation between the enforcement mechanisms and the policy decisions, and if the policy decision software is clearly identifiable in the system's architecture. This paper describes a prototype Unix system based on Mach which provides mandatory control over all kernel-supported operations. The prototype work modified the Mach kernel by extending its limited control mechanisms based on the Mach port right. The control extensions allow a mandatory control policy to specify control over not only access to an object via a port right, but over the individual services supported by the object. The mandatory security policy is implemented in an external Security Server which provides very strong separation between policy enforcement and policy decision software. This makes it possible to support a wide range of security policies with no change to the kernel or applications.
Visualization and interaction in the computer science formal languages course with JFLAP
Authors: M. Procopiuc
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The computer science formal languages course becomes a more traditional computer science course by integrating visual and interactive tools into the course, allowing students to gain hands-on experience with theoretical concepts. We explain how the tool JFLAP can be used in such a manner.
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Authors: Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer, Pablo Galdamez
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution independently. This availability gain is traded against consistency, since several replicas of the same objects could be updated separately. Once partitioning terminates, divergences in the replicated state needs to be reconciled. One way to reconcile the state consists of letting the application manually solve inconsistencies. However, there are several situations where automatic reconciliation of the replicated state is meaningful. We have implemented replication and automatic reconciliation protocols that can be used as building blocks in a partition-tolerant middleware. The novelty of the protocols is the continuous service of the application even during the reconciliation process. A prototype system is experimentally evaluated to illustrate the increased availability despite network partitions.
Convolution using the undecimated discrete wavelet transform
Authors: Haitao Guo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Convolution is one of the most widely used digital signal processing operations. It can be implemented using the fast Fourier transform (FFT) with a computational complexity of O (N log N). The undecimated discrete wavelet transform (UDWT) is linear and shift invariant, so it can also be used to implement convolution. We propose a scheme to implement the convolution using the UDWT, and study its advantages and limitations.
Complete Sequent Calculi for Induction and Infinite Descent
Authors: James Brotherston, Alex Simpson
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

This paper compares two different styles of reasoning with inductively defined predicates, each style being encapsulated by a corresponding sequent calculus proof system. The first system supports traditional proof by induction, with induction rules formulated as sequent rules for introducing inductively defined predicates on the left of sequents. We show this system to be cut-free complete with respect to a natural class of Henkin models; the eliminability of cut follows as a corollary. The second system uses infinite (non-well-founded) proofs to represent arguments by infinite descent. In this system, the left rules for inductively defined predicates are simple case-split rules, and an infinitary, global condition on proof trees is required to ensure soundness. We show this system to be cut-free complete with respect to standard models, and again infer the eliminability of cut. The second infinitary system is unsuitable for formal reasoning. However, it has a natural restriction to proofs given by regular trees, i.e. to those proofs representable by finite graphs. This restricted "cyclic" system subsumes the first system for proof by induction. We conjecture that the two systems are in fact equivalent, i.e., that proof by induction is equivalent to regular proof by infinite descent.
Face recognition using DCT-based feature vectors
Authors: C. Podilchuk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Face recognition has many applications ranging from security access to video indexing by content. We describe an automatic face recognition system which is VQ-based and examine the effects of feature selection, feature dimensionality and codebook size on recognition performance in the VQ framework. In particular, we examine DCT-based feature vectors in such a system. DCT-based feature vectors have the additional appeal that the recognition can be performed directly on the bitstream of compressed images which are DCT-based. The system described consists of three parts: a preprocessing step to segment the face, the feature selection process and the classification. Recognition rates for a database of 500 images shows promising results.
PLS and dimension reduction for classification
Authors: Yushu Liu, William Rayens
Venue: Computational Statistics (2007)

Barker and Rayens (J Chemometrics 17:166---173, 2003) offered convincing arguments that partial least squares (PLS) is to be preferred over principal components analysis (PCA) when discrimination is the goal and dimension reduction is required, since at least with PLS as the dimension reduction tool, information involving group separation is directly involved in the structure extraction. In this paper the basic results in Barker and Rayens (J Chemometrics 17:166---173, 2003) are reviewed and some of their ideas and comparisons are illustrated on a real data set, something which Barker and Rayens did not do. More importantly, new results are introduced, including a formal proof for the superiority of PLS over PCA in the two-group case, as well as new connections between PLS for discrimination and an extended class of PLS-like techniques known as "oriented PLS" (OrPLS). In the latter case, a particularly simple subclass of OrPLS procedures, when used to achieve the dimension reduction, is shown to always produce a lower misclassification rate than when "ordinary" PLS is used for the same purpose.
PETS Metrics: On-Line Performance Evaluation Service
Authors: D. P. Young, J. M. Ferryman
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

This paper presents the PETS Metrics On-line Evaluation Service for computational visual surveillance algorithms. The service allows researchers to submit their algorithm results for evaluation against a set of applicable metrics. The results of the evaluation processes are publicly displayed allowing researchers to instantly view how their algorithm performs against previously submitted algorithms. The approach has been validated using seven motion segmentation algorithms.
A family of projective splitting methods for the sum of two maximal monotone operators
Authors: Jonathan Eckstein, B. F. Svaiter
Venue: Mathematical Programming: Series A and B (2007)

A splitting method for two monotone operators A and B is an algorithm that attempts to converge to a zero of the sum A&#x00a0;+&#x00a0;B by solving a sequence of subproblems, each of which involves only the operator A, or only the operator B. Prior algorithms of this type can all in essence be categorized into three main classes, the Douglas/Peaceman-Rachford class, the forward-backward class, and the little-used double-backward class. Through a certain &#x201c;extended&#x201d; solution set in a product space, we construct a fundamentally new class of splitting methods for pairs of general maximal monotone operators in Hilbert space. Our algorithms are essentially standard projection methods, using splitting decomposition to construct separators. We prove convergence through Fej&#x00e9;r monotonicity techniques, but showing Fej&#x00e9;r convergence of a different sequence to a different set than in earlier splitting methods. Our projective algorithms converge under more general conditions than prior splitting methods, allowing the proximal parameter to vary from iteration to iteration, and even from operator to operator, while retaining convergence for essentially arbitrary pairs of operators. The new projective splitting class also contains noteworthy preexisting methods either as conventional special cases or excluded boundary cases.
High level programming for real time FPGA based video processing
Authors: K. Benkrid
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The inherent reprogrammability of field programmable gate arrays (FPGAs) gives them some of the flexibility of software while keeping the performance advantages of an application specific hardware solution. However, the main disadvantage of FPGAs is the low level of their programming model. Although software tools have been drastically improved since the early days of this new technology, they still require the user to think at the hardware level rather than at the algorithmic level. To bridge the gap between the application and implementation levels, we present a high level software environment for FPGA based real time video processing, which aims to hide hardware details completely from the user. Our approach is to provide a flexible FPGA-based image processing coprocessor with a very high level programming interface based on the core operators of image algebra. Our system has been successfully implemented on VISICOM's VigraVision/sup TM/ PCI board giving real time processing of video data.
Finite volume evolution Galerkin (FVEG) methods for three-dimensional wave equation system
Authors: M. Lukáčová-Medvid'ová, G. Warnecke, Y. Zahaykah
Venue: Applied Numerical Mathematics (2007)

The subject of the paper is the derivation of finite volume evolution Galerkin schemes for the three-dimensional wave equation system. The aim is to construct methods which take into account all of the infinitely many directions of propagation of bicharacteristics. The idea is to evolve the initial function using the characteristic cone and then to project onto a finite element space. Numerical experiments are presented to demonstrate the accuracy and the multidimensional behaviour of the solutions. Moreover, we construct further new EG schemes by neglecting the so-called source term, i.e. we mimic Kirchhoff's formula. The numerical test shows that such schemes are more accurate and some of them are of second order.
From Trust to Dependability through Risk Analysis
Authors: Yudistira Asnar, Paolo Giorgini, Fabio Massacci, Nicola Zannone
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The importance of critical systems has been widely recognized and several efforts are devoted to integrate dependability requirements in their development process. Such efforts result in a number of models, frameworks, and methodologies that have been proposed to model and assess the dependability of critical systems. Among them, risk analysis considers the likelihood and severity of failures for evaluating the risk affecting the system. In our previous work, we introduced the Tropos Goal- Risk framework, a formal framework for modeling, assessing, and treating risks on the basis of the likelihood and severity of failures. In this paper, we refine this framework introducing the notion of trust for assessing risks on the basis of the organizational setting of the system. The assessment process is also enhanced to analyze risks along trust relations among actors. To make the discussion more concrete, we illustrate the framework with a case study on partial airspace delegation in Air Traffic Management system.
Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers
Authors: Tzung-Shi Chen, Jang-Ping Sheu
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

In this paper, we devote our efforts to the techniques of allocatiing array elements of nested loops onto multicomputers in a communication-free fashion for parallelizing compilers. The arrays can be partitioned under the communication free criteria with non-duplicate or duplicate data. In addition, the performance of the strategies with non-duplicate and dupli cate array data is compared.
Issues of Adopting Benefits Management Practices of IT Investments in Municipalities: A Delphi Study in Norway
Authors: Tero Paivarinta, Willy Dertz, Leif Skiftenes Flak
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The concept of benefits management highlights explicit practices to facilitate benefits realization from information technology (IT) investments, in addition to plain project management focusing on information systems (IS) deliverables as such. This article presents preliminary results from a Delphi study of identifying critical issues to facilitate adoption of benefits management practices in Norwegian municipalities. Three expert panels were established, representing three stakeholder groups within the domain of managing municipal IT investments: the viewpoint of central government, municipal top management, and municipal middle managers responsible for particular municipal services and domains. The experts of the Delphi panels suggested 59 issues and identified the most important ones for further scrutiny and discussion. The results both confirm and complement previous suggestions concerning adoption of benefits management in organizations. Moreover, the results provide a basis for further research on the "best (or satisfactory) practices of IT benefits management in municipalities.
Attacking the IPsec Standards in Encryption-only Configurations
Authors: Jean Paul Degabriele, Kenneth G. Paterson
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

We describe new attacks which break any RFCcompliant implementation of IPsec making use of encryption-only ESP in tunnel mode. The new attacks are both efficient and realistic: they are ciphertext-only and need only the capability to eavesdrop on ESP-encrypted traffic and to inject traffic into the network. We report on our experiences in applying the attacks to a variety of implementations of IPsec.
Spatiotemporal motion analysis using five-dimensional tensor voting
Authors: Gerard Medioni
Venue:  (2006)

This work presents a novel spatiotemporal approach to produce motion segmentation and dense temporal trajectories from an image sequence. A common representation of image sequences is a 3D spatiotemporal volume, ( x,y,t), and its corresponding mathematical formalism is the fiber bundle. However, enforcing the spatiotemporal smooth motion constraint which is our only motion model is difficult in the fiber bundle representation. Thus, we convert the representation into a new 5D space (x,y,t,v x,vy) which consists of image domain (x,y ), time domain (t), and velocity domain ( vx,vy). In the space, each moving object produces a separate 3D layer, and the smoothness constraint is now enforced on the layers by the tensor voting framework. This single spatiotemporal smoothing step solves both correspondence and segmentation simultaneously. The motion segmentation is achieved by identifying those layers, and the dense temporal trajectories are obtained by converting the layers back into the fiber bundle representation. Unlike most other motion analysis approaches, our proposed approach does not make restrictive assumptions about the observed scene or camera motion and is therefore generally applicable. We proceed to solve several problems that are hard to solve from the video stream directly because of the dense matching and segmentation steps, but are straightforward with our framework. For instance, image mosaics and 3D scene reconstruction problems require some parameter estimation steps that relate two or more images, and they are theoretically well-defined. However, if the scene contains some large scale moving objects or strong parallax, then the parameter estimation steps become difficult due to the mixed motion information. In this case, our two main results, accurate segmentation and correspondence, can greatly simplify the problems and provide stable results. Another contribution of the work is a GPU-based tensor voting implementation. Tensor voting in the 5D space with a large number of tokens is computationally intensive. The new GPU-based voting implementation achieves significant performance improvement over the conventional CPU-based implementation by taking advantage of the parallel architecture of modern GPUs.
Retention and Reliability Problems in Embedded Flash Memories: Analysis and Test of Defective 2T-FLOTOX Tunnel Window
Authors: O. Ginez, J.-M. Daga, P. Girard, C. Landrault, S. Pravossoudovitch, A. Virazel
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

The evolution of System-on-Chip (SoC) designs involves the development of non-volatile memory technologies like Flash. Embedded flash (eFlash) memories are based on the floating-gate transistor concept and can be subject to complex hard defects creating functional faults. In this paper, we analyze the impact of a defective tunnel window oxide thickness. We show that this defective oxide thickness impacts erase or/and write operations as well as the retention and reliability of the eFlash. The proposed solution to detect such a defective oxide consists in using the voltage disturbance due to the coupling phenomenon existing between bit lines. This particular defective mechanism can be modeled as a coupling fault, especially a State Coupling Fault. Based on this analysis, we propose a test solution that uses two checkerboard patterns; Checkerboard Pattern (CKB) and its complement (CKBI). We show that these two patterns have to be applied by using a parallel programming approach, which allows to increase the coupling phenomenon and thus the voltage disturbance.