ppxscal/embedding_network huggingface dataset:
Unleash the System On Chip using FPGAs and Handel C, 1st edition
Authors: Rajanish K. Kamat, Santosh A. Shinde, Vinod G. Shelake
Venue:  (2009)

"Unleash the System On Chip using FPGAs and Handel C" is an attempt to empower the design community by delivering the 'know-how' developed by the authors with their vast experience in VLSI design. The book effectively showcases carving of SoC through: 'Concept to Product' approach; 'C' based methodology at higher level of abstraction; 'Bottom up & design reuse philosophy'; Edifying with the soft IP cores in Handel C; Pragmatic approach to bridge the gap between design metrics; Synergical approach for combining reconfiguration of FPGAs with soft IP cores; 'Partial reconfiguration', 'concurrent hardware software SoC realization' through Xilinx EDK; 'Network on Chip'; Co-simulation & integration of third party tools; Development of interesting case studies such as fuzzy logic controllers, arithmetic on chip etcetera; Cores for control system using 'picoblaze'; and, Actual screenshots & step by step design flow. 35 Handel C cores, 7 chapters & 128 selected references will facilitate in getting acquainted with innovative design methodologies of building the SoCs & opens a new door of research and development & infinite set of futures in this ever-growing technology of this century.
A Scheme to Base a Hash Function on a Block Cipher
Authors: Shoichi Hirose, Hidenori Kuwakado
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

This article discusses the provable security of an iterated hash function using a block cipher. It assumes the construction using the Matyas-Meyer-Oseas (MMO) scheme for the compression function and the Merkle-Damgård with a permutation (MDP) for the domain extension transform. It is shown that this kind of hash function, MDP-MMO, is indifferentiable from the variable-input-length random oracle in the ideal cipher model. It is also shown that HMAC using MDP-MMO is a pseudorandom function if the underlying block cipher is a pseudorandom permutation under the related-key attack with respect to the permutation used in MDP. Actually, the latter result also assumes that the following function is a pseudorandom bit generator: $$ (E_{IV}(K\oplus\texttt{opad})\oplus K\oplus\texttt{opad})\| (E_{IV}(K\oplus\texttt{ipad})\oplus K\oplus\texttt{ipad})\enspace, $$ where E is the underlying block cipher, IV is the fixed initial value of MDP-MMO, and opad and ipad are the binary strings used in HMAC. This assumption still seems reasonable for actual block ciphers, though it cannot be implied by the pseudorandomness of E as a block cipher. The results of this article imply that the security of a hash function may be reduced to the security of the underlying block cipher to more extent with the MMO compression function than with the Davies-Meyer (DM) compression function, though the DM scheme is implicitly used by the widely used hash functions such as SHA-1 and MD5.
Tactile Spatial Cognition by the Palm
Authors: Misa Grace Kwok
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The purpose of this research is to determine tactile spatial cognition characteristics through basic experiments. Two experiments were conducted: 1) distinctiveness of geometrical figure recognition, 2) haptic spatial recognition. As for the results, difference characteristics between visual spatial cognition and tactile spatial cognition were detected. The vertically direction is more accurate and easier to understand than horizontally direction to recognize spatial information.
Invariants of Composite Networks Arising as a Tensor Product
Authors: Y. Diao, G. Hetyei, K. Hinson
Venue: Graphs and Combinatorics (2009)

We generalize Brylawski&#x2019;s formula of the Tutte polynomial of a tensor product of matroids to colored connected graphs, matroids, and disconnected graphs. Unlike the non-colored tensor product where all edges have to be replaced by the same graph, our colored generalization of the tensor product operation allows individual edge replacement. The colored Tutte polynomials we compute exists by the results of Bollob&#x00e1;s and Riordan. The proof depends on finding the correct generalization of the two components of the pointed Tutte polynomial, first studied by Brylawski and Oxley, and on careful enumeration of the connected components in a tensor product. Our results make the calculation of certain invariants of many composite networks easier, provided that the invariants are obtained from the colored Tutte polynomials via substitution and the composite networks are represented as tensor products of colored graphs. In particular, our method can be used to calculate (with relative ease) the expected number of connected components after an accident hits a composite network in which some major links are identical subnetworks in themselves.
Computer-Based Learning to Improve Breast Cancer Detection Skills
Authors: Yan Chen, Alastair Gale, Hazel Scott, Andrew Evans, Jonathan James
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

In breast cancer screening it is important both to improve and maintain cancer detection skills at their highest levels. The introduction of digital imaging enables computer-based learning to be undertaken outside breast screening centres using a range of different devices. The potential for providing computer-based interpretation training using low-cost devices is detailed. The results demonstrated that naive observers can be trained to recognise certain key breast cancer appearances using a low cost display monitor along with a range of HCI techniques.
A Novel NAT Traversal Mechanism in the Heterogeneous Environment
Authors: Bo Wang, Xiangmin Wen, Sun Yong, Zhen Wei
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Demand for users accessing networks anytime and from anywhere has been increasing in the forthcoming advent of heterogeneous society which is the convergence of the existing networks. The existing NAT technologies have some flaws and can’t meet the requirements in such environment. In this paper, we present a distributed NAT traversal mechanism suitable for the IP heterogeneous network. The mechanism adopts a dynamic address mapping method in the gateways to solve the NAT traversal problem and does not use any extra servers by means of using P2P storage technology to solve the "single point bottleneck" problem. The mechanism makes the less modifications in the gateways and does not add any functions in the client terminals. We have implemented and evaluated a trial system, and the results show that there is almost no performance degradation.
Dynamic edge tracing: Boundary identification in medical images
Authors: D. J. Withey, W. Pedrycz, Z. J. Koles
Venue: Computer Vision and Image Understanding (2009)

Medical image segmentation is a sufficiently complex problem that no single strategy has proven to be completely effective. Historically, region growing, clustering, and edge tracing have been used and while significant steps have been made in the first two, research into automatic, recursive, boundary following has not kept pace. A new, advanced, edge-tracing algorithm capable of combining edge, region, and pixel-classification information, and suitable for magnetic resonance image analysis, is described. The algorithm is inspired by automatic target tracking, as used in civilian and military aerospace operations. Comparison with clustering and level sets is performed. Results indicate that no method is uniformly superior, that the new algorithm provides information not available from the other approaches, and that it can utilize a variety of sources including results from other methods. The algorithm is applied to two-dimensional slice images and extension to three-dimensional images is discussed.
Automated Test Case Generation Based on Coverage Analysis
Authors: Tim A. Majchrzak, Herbert Kuchen
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

We present a tool for the automated generation of unit tests. It symbolically executes Java bytecode in order to find execution paths through a program. To efficiently accomplish this task, it uses constraint solving, choice-point generation and backtracking. As the number of test cases found might be very high and most of them are redundant, we propose a novel way to eliminate test cases based on their contribution to the global coverage of the control-flow and data-flow. Besides discussing the techniques used to achieve this, we present experimental results to prove the feasibility of our approach.
A Logic for PTIME and a Parameterized Halting Problem
Authors: Yijia Chen, Jörg Flum
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

In \cite{NasRemVia05} Nash, Remmel, and Vianu have raised the question whether a logic L_\le, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this question in terms of a parameterized halting problem p-Acc_\le for nondeterministic Turing machines. We analyze the precise relationship between L_\le and p-Acc_\le. We show that p-Acc_\le is not fixed-parameter tractable if ``P \ne NP holds for all time constructible and increasing functions.'' Moreover, a slightly stronger complexity theoretic hypothesis implies that L_\le does not capture polynomial time. Furthermore, we analyze the complexity of various variants of p-Acc_\le and address its construction problem.
On formal models for social verification
Authors: Chien-Ju Ho, Kuan-Ta Chen
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

The introduction of the ESP Game and other Games With A Purpose (GWAP) has demonstrated the potential of human computation in solving AI-hard problems. In such systems, users are normally required to input answers for questions proposed by the system, e.g., descriptions about a picture or a song. Since users may bring up irrelevant inputs intentionally or carelessly, and often the system does not have "correct" answers, we have to rely on the users to verify answers from others. We call this kind of mutual verification of users' answers "social verification." In this paper, we propose formal models for two fundamental social verification mechanisms, simultaneous verification and sequential verification, in human computation systems. By adopting a game-theoretic approach, we perform an equilibrium analysis which explains the effect of each verification mechanism on a system's outcome. Our analysis results show that sequential verification leads to a more diverse and descriptive set of outcomes than simultaneous verification, though the latter is stronger in ensuring the correctness of verified answers. Our experiments on Amazon Mechanical Turk, which asked users to input textual terms related to a word, confirmed our analysis results. We believe that our formal models for social verification mechanisms will provide a basis for the design of future human computation systems.
An Approach for the Design of Secure Communication in Embedded Systems
Authors: Pavel Ocenasek
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

This paper deals with the novel evolutionary approach used for the automatic design of security protocols that also employs the novel grammatical generation of protocols according to the design and security requirements. The first part outlines the introduces security protocols Then, in the main part of this paper, we propose the new algorithm based on natural evolution that is utilized for the automated design of secure communication and security protocols. These protocols may be used for authentication, key distribution and/or for providing other security functions and properties.
Grammar-Based Immune Programming for Symbolic Regression
Authors: Heder S. Bernardino, Helio J. Barbosa
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

This paper presents a Grammar-based Immune Programming (GIP) that can evolve programs in an arbitrary language using a clonal selection algorithm. A context-free grammar that defines this language is used to decode candidate programs (antibodies) to a valid representation. The programs are represented by tree data structures as the majority of the program evolution algorithms do. The GIP is applied to symbolic regression problems and the results found show that it is competitive when compared with other algorithms from the literature.
Re-evaluating machine translation results with paraphrase support
Authors: Liang Zhou, Chin-Yew Lin, Eduard Hovy
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

In this paper, we present ParaEval, an automatic evaluation framework that uses paraphrases to improve the quality of machine translation evaluations. Previous work has focused on fixed n-gram evaluation metrics coupled with lexical identity matching. ParaEval addresses three important issues: support for paraphrase/synonym matching, recall measurement, and correlation with human judgments. We show that ParaEval correlates significantly better than BLEU with human assessment in measurements for both fluency and adequacy.
Measure of Similarity and Compactness in Competitive Space
Authors: Nikolay Zagoruiko
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

The given work is devoted to measures of similarity which are used at discovering of empirical regularities (knowledge). The function of competitive (rival) similarity (FRiS) is proposed as a similarity measure for classification and pattern recognition applications. This function allows one to design effective algorithms for solving all basic data mining tasks, obtain quantitative estimates of the compactness of patterns and the informativeness of feature spaces, and construct easily interpretable decision rules. The method is suitable for any number of patterns regardless of the nature of their distributions and conditionality of training samples (the ratio of the numbers of objects and features). The usefulness of the FRiS is shown by solving a problems of molecular biology.
Secure and Efficient Localization Scheme in Ultra-Wideband Sensor Networks
Authors: Daojing He, Lin Cui, Hejiao Huang, Maode Ma
Venue: Wireless Personal Communications: An International Journal (2009)

This paper addresses the problem of secure localization in hostile environments. We propose a secure and efficient localization scheme to enhance the security function of Ultra-Wideband sensor networks. The method does not only provide strong security against distance reduction attacks, but also distance enlargement attacks. Furthermore, it is a device-independent scheme with strong function of more accurate localization. Based on Petri net, an attack-driven model is also developed. , which provides a formal method to verify our scheme when considering distance enlargement attacks. State analysis, which proves that the potential insecure states are unreachable, shows that the model can provide strong security in the environment with these attacks.
Z/Os Version 1 Release 10 Implementation
Venue:  (2009)

This IBM Redbooks publication positions the new z/OS Version 1 Release 10 for migration by discussing many of the new functions that are available. The goal for the z/OS platform is to eliminate, automate, and simplify tasks without sacrificing z/OS strengths, and to deliver a z/OS management facility that is easy to learn and use. This release of the operating system supports new capabilities that are designed to provide the following enhanced and new functions: - An architectural limit of hundreds of terabytes (TBs) for DASD volumes, up from the current limit of approximately 54 GB per volume. Known as Extended Address Volume (EAV), this function is planned to initially support 223 GB per volume on z/OS V1R10 and IBM System StorageTM DS8000 , when available. - Up to 64 engines, up to 1.5 TB per server with up to 1.0 TB of real memory per LPAR, and support for large (1 MB) pages on the z10 EC, providing performance for critical workloads. - HiperDispatch can help provide increased scalability and performance of higher n-way z10 EC systems by improving the way workload is dispatched within the server. - A new Basic HyperSwapTM capability (to be enabled by TotalStorage Productivity Center for Replication Basic Edition for System z). - Improved management for processor capacity via a new Capacity Provisioning Manager. - Improved productivity with simplifying diagnosis and problem determination. - Expanded Health Check services. - Automatic dump and re-IPL capability. 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
Packet pacing in small buffer optical packet switched networks
Authors: Vijay Sivaraman, Hossam Elgindy, David Moreland, Diethelm Ostry
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In the absence of a cost-effective technology for storing optical signals, emerging optical packet switched (OPS) networks are expected to have severely limited buffering capability. To mitigate the performance degradation resulting from small buffers, this paper proposes that optical edge nodes "pace" the injection of traffic into the OPS core. Our contributions relating to pacing in OPS networks are three-fold: first, we develop real-time pacing algorithms of poly-logarithmic complexity that are feasible for practical implementation in emerging high-speed OPS networks. Second, we provide an analytical quantification of the benefits of pacing in reducing traffic burstiness and traffic loss at a link with very small buffers. Third, we show via simulations of realistic network topologies that pacing can significantly reduce network losses at the expense of a small and bounded increase in end-to-end delay for real-time traffic flows. We argue that the loss-delay tradeoff mechanism provided by pacing can be instrumental in overcoming the performance hurdle arising from the scarcity of buffers in OPS networks.
A Novel Supervised Clustering Based on the Feature Classification Weight
Authors: Qi Zhao, Haitao Qu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In the d-dimensional feature space, the classification weight is defined against the different contribution of every feature that used to classification on the training sample set. And the classification weight calculates the membership functions which set up unascertained classification. Then a novel supervised clustering algorithm based on above is given. The algorithm is concise in calculation, fast in speed and effective in decreasing the computational complexity dramatically. IRIS data training demonstrates that the algorithm is much better than other clustering methods.
Adaptive goal recognition
Authors: Neal Lesh
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Because observing the same actions can warrant different conclusions depending on who executed the actions, a goal recognizer that works well on one person might not work well on another. Two problems that arise in providing user-specific recognition are how to consider the vast number of possible adaptations that might be made to the goal recognizer and how to evaluate a particular set of adaptations. For the first problem, we evaluate the use of hillclimbing to search the space of all combinations of an input set of adaptations. For the second problem, we present an algorithm that estimates the accuracy and coverage of a recognizer on a set of action sequences the individual has recently executed. We use these techniques to construct Adapt, a recognizer-independent unsupervised-learning algorithm for adapting a recognizer to a person's idiosyncratic behaviors. Our experiments in two domains show that applying Adapt to the BOCE recognizer can improve its performance by a factor of two to three.
Investigation of Normalised Time of Increasing Vocal Fold Contact as a Discriminator of Emotional Voice Type
Authors: Peter J. Murphy, Anne-Maria Laukkanen
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

To date, descriptions of thecategorisation ofemotional voice type have mostly been provided in terms of fundamental frequency (f0), amplitude and duration. It is of interest to seek additional cues that may help to improve recognition of emotional colouring in speech, and, expressiveness in speech synthesis. The present contribution examines a specific laryngeal measure - the normalised time of increasing contact of the vocal folds (NTIC) i.e. increasing contact time divided by cycle duration - as estimated from the electroglottogram signal. This preliminary study, using a single female speaker, analyses the sustained vowel [a:], produced when simulating the emotional states anger, joy, neutral, sad and tender. The results suggest that NTIC may not be ideally suited for emotional voice discrimination. Additional measures are suggested to further characterise the emotional portrayals.
Solving TSP by using Lotka-Volterra neural networks
Authors: Manli Li, Zhang Yi, Min Zhu
Venue: Neurocomputing (2009)

This paper proposes a new approach to solve traveling salesman problem (TSP) by using a class of Lotka-Volterra neural networks (LVNN) with global inhibition. Some stability criteria that ensure the convergence of valid solutions are obtained. It is proved that an equilibrium state is stable if and only if it corresponds to a valid solution of the TSP. Thus, a valid solution can always be obtained whenever the network convergence to a stable state. A set of analytical conditions for optimal settings of LVNN is derived. Simulation results illustrate the theoretical analysis.
Tool Support for the Design and Management of Spatial Context Models
Authors: Nazario Cipriani, Matthias Wieland, Matthias Grossmann, Daniela Nicklas
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

A central task in the development of context-aware applications is the modeling and management of complex context information. In this paper, we present the NexusEditor, which eases this task by providing a graphical user interface to design schemas for spatial context models, interactively create queries, send them to a server and visualize the results. One main contribution is to show how schema awareness can improve such a tool: the NexusEditor dynamically parses the underlying data model and provides additional syntactic checks, semantic checks, and short-cuts based on the schema information. Furthermore, the tool helps to design new schema definitions based on the existing ones, which is crucial for an iterative and user-centric development of context-aware applications. Finally, it provides interfaces to existing information spaces and visualization tools for spatial data like GoogleEarth.