ppxscal/embedding_network huggingface dataset:
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
Authors: A. Ahlander, H. Hellsten, K. Lind, J. Lindgren, B. Svensson
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial question is whether it is at all possible to meet the demands with state-of-the-art technology or foreseeable new technology. It is therefore crucial to understand the computational flow, with its associated memory, bandwidth and processing demands. In this paper we analyse the application in order to, primarily, understand the algorithms and identify the challenges they present on a basic architectural level. The processing in the radar system is characterized by working on huge data sets, having complex memory access patterns, and doing real-time compensations for flight path errors. We propose algorithm solutions and execution schemes in interplay with a two-level (coarse-grain/fine-grain) system parallelization approach, and we provide approximate models on which the demands are quantified. In particular, we consider the choice of method for the performance-intensive data interpolations. This choice presents a trade-off problem between computational performance and size of working memory. The results of this "upstream" study will serve as a basis for further, more detailed architecture studies.
Opportunities in System testing
Authors: Arun Bahulkar, Rahul Kelkar
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Performing an effective system test requires an indepth knowledge of the domain and system being tested and an effective test design method, coupled with the right test infrastructure. The current state-of-the-art does not respect the constraint that Subject Matter Experts (SMEs) are in short supply, nor exploit the fact that similar systems have been built and tested in the past. Most current state-of-the-art methods do not leverage the various models and specifications and other design or implementation artifacts to simplify the test process. While there is a lot of focus on generating test inputs from specifications, inadequate attention has been paid to verifying test results. This paper tries to highlight some of the problems and research opportunities in this area.
Guest Editorial Special Collection on Program Testing
Authors: B. Chandrasekaran
Venue: IEEE Transactions on Software Engineering (1980)

THIS special collection had its genesis at the IEEE Computer Society Workshop on Software Testing and Test Documentation, held in Fort Lauderdale, Florida, during December 18-20, 1978. This collection is devoted to selected papers on program testing that were presented at the Workshop. It contains six papers whose concerns span a wide range: theoretical issues, practical expenence With particular strategies, extension of a class of techniques to new classes of language constructs, and building integrated test tools. In the next section, we present an overview of the papers in the collection. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Information disclosure under realistic assumptions: privacy versus optimality
Authors: Lei Zhang, Sushil Jajodia, Alexander Brodsky
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

The problem of information disclosure has attracted much interest from the research community in recent years. When disclosing information, the challenge is to provide as much information as possible (optimality) while guaranteeing a desired safety property for privacy (such as l-diversity). A typical disclosure algorithm uses a sequence of disclosure schemas to output generalizations in the nonincreasing order of data utility; the algorithm releases the first generalization that satisfies the safety property. In this paper, we assert that the desired safety property cannot always be guaranteed if an adversary has the knowledge of the underlying disclosure algorithm. We propose a model for the additional information disclosed by an algorithm based on the definition of deterministic disclosure function (DDF), and provide definitions of p-safe and p-optimal DDFs. We give an analysis for the complexity to compute a p-optimal DDF. We show that deciding whether a DDF is p-optimal is an NP-hard problem, and only under specific conditions, we can solve the problem in polynomial time with respect to the size of the set of all possible database instances and the length of the disclosure generalization sequence. We then consider the problem of microdata disclosure and the safety condition of l-diversity. We relax the notion of p-optimality to weak p-optimality, and develop a weak p-optimal algorithm which is polynomial in the size of the original table and the length of the generalization sequence.
Modeling Automotive Engine Control Module with Neural Network Trained by Iterated Kalman Filter Algorithm
Authors: Pu Sun, Kenneth Marko, Yaqi Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

An attempt has been made to model a production engine control module. Both extended Kalman filter (EKF) algorithm and iterated extended Kalman filter (IEKF) algorithm are used in the construction of the model. The results shows the model trained by both algorithms can produce accurate results with RMS errors in a range of 2- 3%, while iterated extended Kalman filter algorithm outperforms the extended Kalman filter algorithm
Dcv: a causality detection approach for large-scale dynamic collaboration environments
Authors: Ning Gu, Qiwei Zhang, Jiangming Yang, Wei Ye
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Recent studies have indicated the significance of supporting real-time group editing in "Wiki" applications, whose collaboration environments have their dynamic and large-scale nature. Correct capture of causal relationships between operations from different users is crucial in order to preserve consistency of object copies. This challenge was resolved by employing vector logical clock. But since its size is equal to the number of cooperating sites, it has low efficiency when dealing with a collaborative environment involving a large number of participants. In this paper, we propose a direct causal vector (DCV) approach for solving causality detection issues in real-time group editors. DCV timestamp does not record the causality information that can be deduced from the transitivity of causal relation. As a result, it can automatically reduce its own size when people leave the collaboration session and always keep small. We prove that DCV approach is well fit for capturing causality in wiki like large-scale dynamic collaboration environments.
FlexFetch: A History-Aware Scheme for I/O Energy Saving in Mobile Computing
Authors: Feng Chen, Song Jiang, Weisong Shi, Weikuan Yu
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Extension of battery lifetime has always been a major issue for mobile computing. While more and more data are involved in mobile computing, energy consumption caused by I/O operations becomes increasingly large. In a pervasive computing environment, the requested data can be stored both on the local disk of a mobile computer by using the hoarding technique, and on the remote server, where data are accessible via wireless communication. Based on the current operational states of local disk (active or standby), the amount of data to be requested (small or large), and currently available wireless bandwidth (strong or weak reception), data access source can be adaptively selected to achieve maximum energy reduction. To this end, we propose a profile-based I/O management scheme, FlexFetch, that is aware of access history and adaptive to current access environment. Our simulation experiments driven by real-life traces demonstrate that the scheme can significantly reduce energy consumption in a mobile computer compared with existing representative schemes.
User Feedback in Probabilistic Integration
Authors: Ander de Keijzer, Maurice van Keulen
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Data integration approaches mostly attempt to resolve semantic uncertainty and conflicts between data sources during the data integration process. In some application areas, this is impractical or even prohibitive. We propose a probabilistic XML approach that allows storage and querying of uncertain data. It requires only minimal user involvement during data integration, because most semantic uncertainty and conflicts can be resolved by exploiting user feedback on query results, thus effectively postponing user involvement to query time when a user already interacts with the system. We show that repeated feedback gradually improves the factual correctness of integrated data.
A Method for Blur and Similarity Transform Invariant Object Recognition
Authors: Ville Ojansivu, Janne Heikkila
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, we propose novel blur and similarity transform (i.e. rotation, scaling and translation) invariant features for the recognition of objects in images. The features are based on blur invariant forms of the log-polar sampled phase-only bispectrum and are invariant to centrally symmetric blur, including linear motion and out of focus blur. An additional advantage of using the phase-only bispectrum is the invariance to uniform illumination changes. According to our knowledge, the invariants of this paper are the first blur and similarity transform invariants in the Fourier domain. We have compared our features to the blur invariants based on complex image moments using simulated and real data. The moment invariants have not been evaluated earlier in the case of similarity transform. The results show that our invariants can recognize objects better in the presence of noise.
Use of Variable Fuzzy Sets Method for Regional Water Security Evaluation
Authors: Huicheng Zhou, Li Wu, Bin He
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Due to the significance of the region water security, ten indexes are selected as evaluation indexes for regional water security from society, economy and ecology respectively. After using the law of entropy to calculating the indexes weights, variable fuzzy sets is presented to calculate the rank feature value of water security system. Finally the model is used to evaluate the water security of some city. The method can fully use one's experience and knowledge, qualitative and quantitative information of index system to obtain weights of indexes for operating comprehensive evaluation for water security, and it can effectively evaluate the status of water security. The numerical example has shown that the proposed method is feasible and effective, and the evaluation results are reasonable.
On the relationship between the duration of an encounter and the evolution of cooperation in the iterated prisoner's dilemma
Authors: David B. Fogel
Venue: Evolutionary Computation (1995)

Evolutionary programming experiments are conducted to examine the relationship between the durations of encounters and the evolution of cooperative behavior in the iterated prisoner's dilemma. A population of behavioral strategies represented by finite-state machines is evolved over successive generations, with selection made on the basis of individual fitness. Each finite-state machine is given an additional evolvable parameter corresponding to the maximum number of moves it will execute in any encounter. A series of Monte Carlo trials indicates distinct relationships between encounter length and cooperation; however, no causal relationship can be positively identified.
Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities
Authors: Ernie Brickell, Jiangtao Li
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

Direct Anonymous Attestation (DAA) is a scheme that enables the remote authentication of a Trusted Platform Module (TPM) while preserving the user's privacy. A TPM can prove to a remote party that it is a valid TPM without revealing its identity and without linkability. In the DAA scheme, a TPM can be revoked only if the DAA private key in the hardware has been extracted and published widely so that verifiers obtain the corrupted private key. If the unlinkability requirement is relaxed, a TPM suspected of being compromised can be revoked even if the private key is not known. However, with the full unlinkability requirement intact, if a TPM has been compromised but its private key has not been distributed to verifiers, the TPM cannot be revoked. Furthermore, a TPM cannot be revoked from the issuer, if the TPM is found to be compromised after the DAA issuing has occurred. In this paper, we present a new DAA scheme called Enhanced Privacy ID (EPID) scheme that addresses the above limitations. While still providing unlinkability, our scheme provides a method to revoke a TPM even if the TPM private key is unknown. This expanded revocation property makes the scheme useful for other applications such as for driver's license. Our EPID scheme is efficient and secure in the same security model as DAA, i.e. in the random oracle model under the strong RSA assumption and the decisional Diffie-Hellman assumption.
Inductive Fault Analysis of MOS Integrated Circuits
Authors: John Shen, W. Maly, F. Ferguson
Venue: IEEE Design Test (1985)

Inductive Fault Analysis (IFA) is a systematic Procedure to predict all the faults that are likely to occur in MOS integratedcircuit or subcircuit The three major steps of the IFA procedure are: (1) generation of Physical defects using statisticaldata from the fabrication process; (2) extraction of circuit-level faults caused by these defects; and (3) classificationof faults types and ranking of faults based on their likelihood of occurrence Hence, given the layout of an IC, a fault modeland a ranked fault list can be automatically generated which take into account the technology, layout, and process characteristics.The IFA procedure is illustrated by its applications to an example circuit. The results from this sample led to some veryinteresting observations regarding nonclassical faults.
Back Covers [blanks]
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The Large Hadron Collider (LHC) at CERN, the European Organization for Nuclear Research, needs to produce unprecedented volumes of data when it starts operation in 2007. To provide for its computational needs, the LHC computing grid (LCG) should be deployed as a worldwide computational grid service, providing the middleware upon which the physics analysis for the LHC can be carried out. In 2003, versions of this middleware were deployed which were based on the middleware produced by the European Data Grid project (EDG). In 2004 the LCG-2 release, which consisted of the EDG middleware with some minor modifications, was deployed for use by the LHC experiments. A series of data challenges by these experiments were the first real experiment production use of LCG. During the course of the data challenges, many issues and problems were exposed which had not shown up in more limited tests. The deployment, service and development teams worked closely with the experiments to understand these issues and while some of the problems were solved during the data challenges, others exposed fundamental problems with the middleware as deployed in LCG-2. One of these fundamental problems was the performance under real load of the catalog component provided by EDG, the replica location service. To solve these problems a new component was designed, the LCG file catalog (LFC). The LFC moves away from the replica location service model used in previous LCG releases, towards a hierarchical file system model which is more like a UNIX file system. It also adds missing functionality which was requested by the experiments. This paper presents the architecture and implementation of the LFC and evaluates it in a series of performance tests, with up to forty million entries and one hundred requesting threads from multiple clients. The results show good scalability up to the limits of these tests, and compare favourably with other grid catalog implementations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Research collaboration for "humorous interaction" 2-man stand-up comedy (manzai) with a robot
Authors: Junichi Osada, Zenjiro
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

We are now in the process of developing PaPe-jiro as part of our research in human-robot communication. For a robot companion in the home, the mere ability to assist the family with various chores is not enough; it also needs to be able to converse with family members in a pleasant way, so that they develop a fondness for it. We feel that this is one of the most important aspects of our current robot research and development. In collaboration with well-known Japanese comedian Zenjiro, we tackled this challenge by focusing on developing the robot's sense of humor. In this experiment, PaPe-jiro joined Zenjiro onstage as the "straight man" to his comedy routine. This allowed us to explore the possibility of the robot's ability to laugh and joke, as well as search for an appropriate brand of robot-specific humor.
Image Segmentation on Colonies Images by A Combined Algorithm of Simulated Annealing and Genetic Algorithm
Authors: Wang Luo, Weixing Wang, Haijun Liao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

For the segmentation of several typical classes of colony images, there are large numbers of applications. This paper describes a combined algorithm for colony image segmentation. The problem of image segmentation is treated as one of combinatorial optimization. The simulated annealing (SA)-based image segmentation technique is seeing to suffer from several limitations. The search procedure of SA is fairly localized, preventing them from exploring the same diversity of solutions. Although genetic algorithm (GA) has an excellent capability of global researching, its capability of hill-climbing is weak. This combined algorithm may be advantageous in combining the advantages of both GA and SA procedures while alleviating their individual shortcomings. Experiments show that the combined algorithm provides a useful method for colony image segmentation, and the whole image segmentation process time is several time short more than traditional approaches.
Performance Analyses of Paging Algorithms for Compilation of a Highly Modularized Program
Authors: T. Chusho
Venue: IEEE Transactions on Software Engineering (1981)

Previous works on paging behavior have mainly concentrated on procedures, not on data. This paper is an attempt to clarify the paging behavior of data referenced by a newly developed language processor, and theoretically analyze the performance of several page replacement algorithms with no loss of generality.
Hygienic macros through explicit renaming
Authors: William Clinger
Venue: ACM SIGPLAN Lisp Pointers (1991)

This paper describes an alternative to the low-level macro facility described in the Revised4 Report on the Algorithmic Language Scheme [1]. The facility described here is based on explicit renaming of identifiers, and was developed for the first implementation of the hygienic macro expansion algorithm described in [2]. It was the first low-level macro facility to be designed for compatibility with a high-level hygienic macro system, and it remains one of the easiest to understand.
Program Perspectives: A Relational Representation of Measurement Data
Authors: G. D. Ripley
Venue: IEEE Transactions on Software Engineering (1977)

This paper concems the representation and processing of data resulting from the measurement of programs written in high-level programming languages. The value of various "perspectives" of measurement results, especially in languages having many levels of activity, is illustrated. A representation of measurement data based on ideas from relational data bases is presented, in which perspectives can be represented as hierarchically-organized permuted projections of measurement data. Applications described include measurement of Snobol4 and Fortran programs.
A Case Study in Program Transformation: Translation into Polish
Authors: J. Cohen
Venue: IEEE Transactions on Software Engineering (1979)

Program transformation is used to show the correspondence between two known algorithms for translating parenthesized expressions into their polish counterparts. The first algorithm is a syntax-directed translator which produces output upon the recognition of predefined syntactic rules. The second one, suggested by Dijkstra, is of empirical nature: it performs the translation by simulating the operation of a railyard shunt. The second algorithm is more efficient than the first, but less general. This work enables one 1) to assert the correctness of the empirical algorithm, 2) to compare the relative efficiencies of the two algorithms, and 3) to gain insight into the circumstances in which syntax-directed translation may be improved by generalizing the ideas involved in Dijkstra's algorithm.
Principal component analysis for data containing outliers and missing elements
Authors: Sven Serneels, Tim Verdonck
Venue: Computational Statistics Data Analysis (2008)

Two approaches are presented to perform principal component analysis (PCA) on data which contain both outlying cases and missing elements. At first an eigendecomposition of a covariance matrix which can deal with such data is proposed, but this approach is not fit for data where the number of variables exceeds the number of cases. Alternatively, an expectation robust (ER) algorithm is proposed so as to adapt the existing methodology for robust PCA to data containing missing elements. According to an extensive simulation study, the ER approach performs well for all data sizes concerned. Using simulations and an example, it is shown that by virtue of the ER algorithm, the properties of the existing methods for robust PCA carry through to data with missing elements.
Comments on the "Core Vector Machines: Fast SVM Training on Very Large Data Sets"
Authors: Gaëlle Loosli, Stéphane Canu
Venue: The Journal of Machine Learning Research (2007)

In a recently published paper in JMLR, Tsang et al. (2005) present an algorithm for SVM called Core Vector Machines (CVM) and illustrate its performances through comparisons with other SVM solvers. After reading the CVM paper we were surprised by some of the reported results. In order to clarify the matter, we decided to reproduce some of the experiments. It turns out that to some extent, our results contradict those reported. Reasons of these different behaviors are given through the analysis of the stopping criterion.