ppxscal/embedding_network huggingface dataset:
Improved Indifferentiability Security Analysis of chopMD Hash Function
Authors: Donghoon Chang, Mridul Nandi
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

The classical design principle Merkle-Damgård [13,6] is scrutinized by many ways such as Joux's multicollision attack, Kelsey-Schneier second preimage attack etc. In TCC'04, Maurer et al. introduced a strong security notion called as "indifferentiability" for a hash function based on a compression function. The classical design principle is also insecure against this strong security notion whereas chopMD hash is secure with the security bound roughly ¿ 2/2 s where s is the number of chopped bits and ¿ is the total number of message blocks queried by a distinguisher. In case of n = 2s where n is the output size of a compression function, the value ¿ to get a significant bound is 2 s/2 which is the birthday complexity, where the hash output size is s-bit. In this paper, we present an improved security bound for chopMD. The improved bound shown in this paper is (3(n ¿ s) + 1)q/2 s + q/2 n ¿ s ¿ 1 + ¿ 2/2 n + 1 where q is the total number of queries. In case of n = 2s, chopMD is indifferentiably-secure if q = O(2 s /(3s + 1)) and ¿ = O(2 n/2) which are beyond the birthday complexity. We also present a design principle for an n-bit hash function based on a compression function $f : {0,1}^{2n+b} {\Rightarrow} {0,1}^n$ and show that the indifferentiability security bound for this hash function is roughly (3n + 1)¿/2 n . So, the new design of hash function is second-preimage and r-multicollision secure as long as the query complexity (the number of message blocks queried) of an attacker is less than 2 n /(3n + 1) or 2 n(r ¿ 1)/r respectively.
Lossless Information Hiding Scheme Based on Pixels Complexity Analysis
Authors: Tzu-Chuen Lu, Cheng-Chun Huang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper proposes an effective lossless information hiding scheme, in which a host image is quantized firstly to generate spare spaces for hiding secret messages. The proposed scheme applies the complexity analysis of neighboring pixels to predict the number of secret message bits concealed in a pixel. In addition, it reserves the differences between the host image and the quantized image for completely restoring the host image. According to the experimental results, the information capacity of the proposed scheme is 0.9 bpp for the standard Lena while that of Maniccam and Bourbakis’s scheme is 0.3 bpp.
Modelling Support for Design of Safety-Critical Automotive Embedded Systems
Authors: Dejiu Chen, Rolf Johansson, Henrik Lönn, Yiannis Papadopoulos, Anders Sandberg, Fredrik Törner, Martin Törngren
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

This paper describes and demonstrates an approach that promises to bridge the gap between model-based systems engineering and the safety process of automotive embedded systems. The basis for this is the integration of safety analysis techniques, a method for developing and managing Safety Cases, and a systematic approach to model-based engineering --- the EAST-ADL2 architecture description language. Three areas are highlighted: (1) System model development on different levels of abstraction. This enables fulfilling many requirements on software development as specified by ISO-CD-26262; (2) Safety Case development in close connection to the system model; (3) Analysis of mal-functional behaviour that may cause hazards, by modelling of errors and error propagation in a (complex and hierarchical) system model.
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Authors: Patricia Bouyer, Thomas Brihaye, Marcin Jurdziński, Ranko Lazić, Michał Rutkowski
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuous dynamics. A number of analysis problems, such as reachability testing and controller synthesis, are decidable for classes of o-minimal hybrid automata. We generalize existing decidability results for controller synthesis on hybrid automata and we establish new ones by proving that average-price and reachability-price games on hybrid systems with strong resets are decidable, provided that the structure on which the hybrid automaton is defined has a decidable first-order theory. Our proof techniques include a novel characterization of values in games on hybrid systems by optimality equations, and a definition of a new finitary equivalence relation on the states of a hybrid system which enables a reduction of games on hybrid systems to games on finite graphs.
Diabetic Damage Detection in Retinal Images Via a Sparsely-Connected Neurofuzzy Network
Authors: Leonarda Carnimeo
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper a contribution towards diabetic damage detection in retinal images is proposed by synthesizing a Sparsely Connected Neurofuzzy Network for fundus image processing in the presence of retinopathies. A Hopfield-like neurofuzzy subnetwork is firstly synthesized to obtain contrast-enhanced images. After an optimal thresholding performed by an MLP-based neural subsystem, contrast-enhanced images are then globally segmented by a further sparsely-connected neural subnet to highlight vague pale regions. In this way diabetic damaged areas reveal isolated in bipolar output images. Experimental cases are reported and discussed.
Work and Tools
Authors: Peter Drucker
Venue: IEEE Annals of the History of Computing (1982)

Peter Drucker's article, "Work and Tools," provides some insight into the author's perception of how the history of technology should be studied. Occasionally the Annals will print historiographic essays such as this one, relating specifically to the principles of historical research and how they apply to the study of technology. 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
KMRCRelat Algorithm for finding repeated words in sequences: Application on biological sequences
Authors: N. El Kadhi
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

Searching repeated words in sequences is a problem treated in several ways. There are two categories of methods for searching word repetition: Methods for searching exact words and methods for searching approximate words. The exact words search methods allow searching words by not tolerating any errors or differences between words. The approximate words search methods consist in finding the words with K differences (or errors) from targets words M. When words represent continuations of letters or characters belonging to an alphabet S, these errors can be presented by substitution, suppression or insertion of characters. Approximate search methods are more usually used in bioinformatic because they offer greater flexibility allowing to find more words. There are several sequences analysis techniques. The most frequently used one consists of comparing the sequences by aligning them. In this paper, we first clearly delimit our work by studying different techniques. Then, we present a new fast and efficient algorithm derived from two former algorithms. KMRCRelat uses the concept of relational words. In fact, we present a word by its components and the relations between them. We only consider components and their successors relations.
HAMLAT: A HAML-Based Authoring Tool for Haptic Application Development
Authors: Mohamad Eid, Sheldon Andrews, Atif Alamri, Abdulmotaleb Saddik
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Haptic applications have received enormous attention in the last decade. Nonetheless, the diversity of haptic interfaces, virtual environment modeling, and rendering algorithms have made the development of hapto-visual applications a tedious and time consuming task that requires significant programming skills. To tackle this problem, we present a HAML-based Authoring Tool (HAMLAT), an authoring tool based on the HAML description language that allows users to render the graphics and haptics of a virtual environment with no programming skills. The modeler is able to export the developed application in a standard HAML description format. The proposed system comprises three components: the authoring tool (HAMLAT), the HAML engine, and the HAML player. The tool is implemented by extending the 3D Blender modeling platform to support haptic interaction. The demonstrated tool proves the simplicity and efficiency of prototyping haptic applications for non-programmer developers or artists.
New Binding-Concealing Trade-Offs for Quantum String Commitment
Authors: Rahul Jain
Venue: Journal of Cryptology (2008)

String commitment schemes are similar to the well-studied bit commitment schemes in cryptography with the difference that the committing party, say $\mathsf {Alice}$, is supposed to commit a long string instead of a single bit to another party, say $\mathsf {Bob}$. Similar to bit commitment schemes, such schemes are supposed to be binding, i.e., $\mathsf {Alice}$cannot change her choice after committing, and concealing, i.e., $\mathsf {Bob}$cannot find $\mathsf {Alice}$&#x2019;s committed string before $\mathsf {Alice}$reveals it. Ideal commitment schemes are known to be impossible. Even if some degree of cheating is allowed, Buhrman et al.&#x00a0;(quant-ph/0504078, Nov. 2007) have recently shown that there are some binding-concealing trade-offs that any quantum string commitment scheme ( $\mathsf {QSC}$) must follow. They showed trade-offs both in the scenario of single execution of the protocol and in the asymptotic regime of sufficiently large number of parallel executions of the protocol. We present here new trade-offs in the scenario of single execution of a $\mathsf {QSC}$protocol. Our trade-offs also immediately imply the trade-off shown by Buhrman et al. in the asymptotic regime. We show our results by making a central use of an important information theoretic tool called the substate theorem due to Jain et al. (Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp.&#x00a0;429&#x2013;438, 2002). Our techniques are quite different from that of Buhrman et al.&#x00a0;(quant-ph/0504078, Nov. 2007) and may be of independent interest.
CLEF2006 Question Answering Experiments at Tokyo Institute of Technology
Authors: E. W. Whittaker, J. R. Novak, P. Chatain, P. R. Dixon, M. H. Heie, S. Furui
Venue: Evaluation of Multilingual and Multi-modal Information Retrieval: 7th Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 20-22, 2006, Revised Selected Papers (2007)

In this paper we present the experiments performed at Tokyo Institute of Technology for the CLEF2006 Multiple Language Question Answering (QA@CLEF) track. Our approach to QA centres on a non-linguistic, data-driven, statistical classification model that uses the redundancy of the web to find correct answers. For the cross-language aspect we employed publicly available web-based text translation tools to translate the question from the source into the corresponding target language, then used the corresponding mono-lingual QA system to find the answers. The hypothesised correct answers were then projected back on to the appropriate closed-domain corpus. Correct and supported answer performance on the mono-lingual tasks was around 14% for both Spanish and French. Performance on the cross-language tasks ranged from 5% for Spanish-English, to 12% for French-Spanish. Our method of projecting answers onto documents was shown not to work well: in the worst case on the French-English task we lost 84% of our otherwise correct answers. Ignoring the need for correct support information the exact answer accuracy increased to 29% and 21% correct on the Spanish and French mono-lingual tasks, respectively.
Development of a distributed collaborative design framework within peer-to-peer environment
Authors: L. Q. Fan, A. Senthil Kumar, B. N. Jagdish, S. H. Bok
Venue: Computer-Aided Design (2008)

Distributed collaborative design and manufacture enables manufacturing organizations to maintain competitiveness in the fiercely competitive global industry. This requires that the distributed system not only maintains data consistency across globally-distributed locations seamlessly, but also allows team members to access the storage system and computing resources transparently and securely. Current grid applications mainly based on client-server architecture are inflexible and rigid for fast changing collaborations among manufacturers, especially for small and medium enterprises. In this paper, a distributed collaborative design framework is presented with a hybrid of grid and peer-to-peer technology. In order to access computational resources for design, analysis and process simulation, a meta-scheduler is designed and implemented. It helps in resource discovery and optimal utilization of resources. A test bed is established, based on the framework proposed to demonstrate a distributed collaborative design and manufacturing environment.
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
Authors: Christian Hundt, Maciej Liśkiewicz
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

The problem of two-dimensional pattern matching invariant under a given class of admissible transformations $\mathcal{F}$ is to find in text T matches of transformed versions f(P) of the pattern P, for all f in $\mathcal{F}$. In this paper, pattern matching invariant under compositions of real scaling and rotation are investigated. We give a new discretization technique for this class of transformations and prove sharp lower and upper bounds on the number of different possibilities to transform a pattern in this way. Subsequently, we present the first efficient pattern matching algorithm invariant under compositions of scaling and rotation. The algorithm works in time O(m 2 n 6) for patterns of size m 2 and texts of size n 2. Our method can also be applied to the image matching problem, the well known issue in the image processing research.
Optimal Scheduling with Resources for Application Execution in 3G Networks
Authors: Roman Englert
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

Today the number of data applications for cellular phones increases rapidly. Most of these data applications require a connection to the Service Delivery Platform (SDP) in the cellular network. As a consequence the booting of the cellular phone and the starting of mobile applications take several minutes. In this paper an approach is presented to optimise the start time of mobile applications. The idea is to partition the call set-up of mobile applications into modules and to apply them to scheduling. Main challenges are to take into account the required temporal and operational resources, and to generate the schedule in real-time. The applied scheduler is based on the Simplex method from Discrete Mathematics and delivers en passant the proof for the optimality. Experiments demonstrate the approach and the results are compared with former experiments based on a temporal planner from the field of Artificial Intelligence (AI).
TRT System for Heat Pumps
Authors: Radovan Hájovský, Martin Pie
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper deals with problematic of renewable energy sources focused mainly on use of Sun energy, Hydrogen technology and, above all, use of heat pumps for buildings heating. It gives a basic introduction into renewable energy sources and their use in practice. Another part described in details is Thermal Response Test (TRT). This test is instrumental to find out a response of rock massive in which a heat pump might be installed. Department of Measurement and Control have dealt with use of alternative energy sources for several years.
A Model of Dynamic Separation for Transactional Memory
Authors: Martín Abadi, Tim Harris, Katherine F. Moore
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We provide a precise formulation of dynamic separation and compare it with other programming disciplines. Furthermore, exploiting dynamic separation, we investigate some possible implementations of the calculus and we establish their correctness.
Cell Assisted APMC
Authors: Alexandre Borghi, Thomas Herault, Richard Lassaigne, Sylvain Peyronnet
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

In this paper, we give an overview of APMC-CA (Cell Assisted Approximate Probabilistic Model Checker). APMC-CA is a new version of APMC dedicated to the Cell processor. We show that using the Cell architecture, we achieve better performances than APMC 3.0.
Spatial Clustering with Obstacles Constraints by Hybrid Particle Swarm Optimization with GA Mutation
Authors: Xueping Zhang, Hui Yin, Hongmei Zhang, Zhongshan Fan
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

In this paper, we propose a novel Spatial Clustering with Obstacles Constraints (SCOC) by an advanced Hybrid Particle Swarm Optimization (HPSO) with GA mutation. In the process of doing so, we first use HPSO to get obstructed distance, and then we developed a novel HPKSCOC based on HPSO and K-Medoids to cluster spatial data with obstacles constraints. The experimental results show that the HPKSCOC algorithm can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints and practicalities of spatial clustering; and it performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).
A new dependence ordering with applications
Authors: Subhash Kochar, Maochao Xu
Venue: Journal of Multivariate Analysis (2008)

In this paper, we introduce a new copula-based dependence order to compare the relative degree of dependence between two pairs of random variables. Relationship of the new order to the existing dependence orders is investigated. In particular, the new ordering is stronger than the partial ordering, more monotone regression dependence as developed by Averous et al. [J. Averous, C. Genest, S.C. Kochar, On dependence structure of order statistics, Journal of Multivariate Analysis 94 (2005) 159-171]. Applications of this partial order to order statistics, k-record values and frailty models are given.
A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
Authors: Jun Kurihara, Shinsaku Kiyomoto, Kazuhide Fukushima, Toshiaki Tanaka
Venue: Proceedings of the 11th international conference on Information Security (2008)

In Shamir's (k,n)-threshold secret sharing scheme (threshold scheme), a heavy computational cost is required to make n shares and recover the secret. As a solution to this problem, several fast threshold schemes have been proposed. This paper proposes a new (k,n)-threshold scheme. For the purpose to realize high performance, the proposed scheme uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret. We prove that the proposed scheme is a perfect secret sharing scheme, every combination of k or more participants can recover the secret, but every group of less than k participants cannot obtain any information about the secret. Moreover, we show that the proposed scheme is an ideal secret sharing scheme similar to Shamir's scheme, which is a perfect scheme such that every bit-size of shares equals that of the secret. We also evaluate the efficiency of the scheme, and show that our scheme realizes operations that are much faster than Shamir's. Furthermore, from the aspect of both computational cost and storage usage, we also introduce how to extend the proposed scheme to a new (k,L,n)-threshold ramp scheme similar to the existing ramp scheme based on Shamir's scheme.
Software Verification: Roles and Challenges for Automatic Decision Procedures
Authors: Aarti Gupta
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

Software model checking has become popular with the successful use of predicate abstraction and refinement techniques to find real bugs in low-level C programs. At the same time, verification approaches based on abstract interpretation and symbolic execution are also making headway in real practice. Much of the recent progress is fueled by advancements in automatic decision procedures and constraint solvers, which lie at the computational heart of these approaches. In this talk, I will describe our experience with several of these verification approaches, highlighting the roles played by automatic decision procedures and their interplay with the applications. Specifically, I will focus on SAT- and SMT-based model checking, combined with abstract domain analysis based on polyhedra representations. I will also describe some challenges from software verification that can motivate interesting research problems in this area.
A Study on Secure Contents Transmission in Home Domain
Authors: Young-Gu Lee, Chang Bo Lee, Jung Jae Kim, Moon Seog Jun
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Home network is where all the electronic appliance in the house are gathered to form a united network. It is being expanded due to the fact that the electronic appliances are developing through the time. The increasing number of digital contents are also helping. However, because the mutual management among contents electronic appliances are weak, it is hard to constantly maintain the protection of digital contents' copyrights and if moving contents among electronic appliances are needed, license from DRM server needs to be reissued. Therefore in this thesis I will introduce the framework that will allow contents to move freely to other device through device mutual authentication in home network as well as suggest the system that will reduce the pressure of maintaining DRM server license and make user authentication allow access to contents even when an outside user tries to access home network.
New Products
Authors: Guerney D. Hunt, Keith Farkas
Venue: IEEE Pervasive Computing (2003)

In this column, we look at nonmainstream personal productivity devices: a PDA designed for the blind and a nonproprietary version of the Blackberry service. We also report on a wireless MAN solution, a product line for MP3 streaming, and an asset tracking solution.