ppxscal/embedding_network huggingface dataset:
Using Physical Experiments as Oracles
Authors: Edwin J. Beggs
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

In my talk I will consider how a digital computer (a Turing machine for the sake of being definite) could communicate with the physical world. Turing himself gave a mythological name to an external source of information for a computer - an oracle. We shall consider how a physical experiment can be used to function as an oracle for a computer - a physical oracle. Thought experiments can be constructed using various physical theories, and we will examine their properties when used as oracles. The fundamental ideas we have to introduce into oracles for this are the time taken to perform the experiment, and the possibility of error in the answer.
Proceedings of the Workshop on Computational Approaches to Figurative Language
Venue: ACL Workshops (2007)

Figurative language, such as metaphor, metonymy, idioms, personification, simile, among others, is in abundance in natural discourse. It is an effective apparatus to heighten effect and convey various meanings, such as humor, irony, sarcasm, affection, etc. Figurative language can be found not only in fiction, but also in everyday speech, newspaper articles, research papers, and even technical reports. The recognition of figurative language use and the computation of figurative language meaning constitute one of the hardest problems for a variety of natural language processing tasks, such as machine translation, text summarization, information retrieval, and question answering. Resolution of this problem involves both a solid understanding of the distinction between literal and non-literal language and the development of effective computational models that can make the appropriate semantic interpretation automatically. The emphasis of this workshop is on computational approaches to figurative language, be it modeling or natural language processing. The goal of the workshop is to provide a venue for researchers to reach a better understanding of the new issues and challenges that need to be tackled in dealing with non-literal phenomena. We are very happy that the workshop has attracted people from different disciplines and hope that the workshop will continue to live in the future.
SystemAda: an ada based system-level hardware description language
Authors: Negin Mahani, Parnian Mokri, Mahshid Sedghi, Zainalabedin Navabi
Venue: ACM SIGAda Ada Letters (2009)

Recent research on system level design has produced a new level of abstraction for description of hardware that is referred to as Transaction Level Modeling, or TLM. TLM separates hardware into computation and communication units and describes each at a very abstract level. Another important property of electronic circuits, which is also modeled well in TLM, is concurrency of tasks and operations. Inherent concurrency of Ada, makes this language a good candidate for design and description of modern electronic systems. This paper* describes how to use. Ada as a system description language like SystemC, and will use Ada compilers (such as Gnat) to evaluate systems described using Ada. We refer to the adaptation of Ada for system level description as SystemAda. This paper reviews Ada programming language requirements for modeling behavior of a digital system at transaction level, and considers possible approaches for extending Ada to meet these requirements.
A study of causal discovery with weak links and small samples
Authors: Honghua Dai, Kevin Korb, Chris Wallace Xindong Wu
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Weak causal relationships and small sample size pose two significant difficulties to the automatic discovery of causal models from observational data. This paper examines the influence of weak causal links and varying sample sizes on the discovery of causal models. The experimental results illustrate the effect of larger sample sizes for discovering causal models reliably and the relevance of the strength of causal links and the complexity of the original causal model. We present indicative evidence of the superior robustness of MML (Minimum Message Length) methods to standard significance tests in the recovery of causal links. The comparative results show that the MML-CI (the MML Causal Inducer) causal discovery system finds better models than TETRAD II given small samples from linear causal models. The experimental results also reveal that MML-CI finds weak links with smaller sample sizes than can TETRAD II.
New Birthday Attacks on Some MACs Based on Block Ciphers
Authors: Zheng Yuan, Wei Wang, Keting Jia, Guangwu Xu, Xiaoyun Wang
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

This paper develops several new techniques of cryptanalyzing MACs based on block ciphers, and is divided into two parts.The first part presents new distinguishers of the MAC construction Alred and its specific instance Alpha-MAC based on AES. For the Alred construction, we first describe a general distinguishing attack which leads to a forgery attack directly with the complexity of the birthday attack. A 2-round collision differential path of Alpha-MAC is adopted to construct a new distinguisher with about 265.5 chosen messages and 265.5 queries. One of the most important results is to use this new distinguisher to recover the internal state, which is an equivalent subkey of Alpha-MAC. Moreover, our distinguisher on Alred construction can be applied to the MACs based on CBC and CFB encryption modes.The second part describes the first impossible differential attack on MACs-Pelican, MT-MAC-AES and PC-MAC-AES. Using the birthday attack, enough message pairs that produce the inner near-collision with some specific differences are detected, then the impossible differential attack on 4-round AES to the above mentioned MACs is performed. For Pelican, our attack recovers its internal state, which is an equivalent subkey. For MT-MAC-AES, the attack turns out to be a subkey recovery attack directly. The complexity of the two attacks is 285.5 chosen messages and 285.5 queries. For PC-MAC-AES, we recover its 256-bit key with 285.5 chosen messages and 2128 queries.
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
Authors: Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Neighborhood Interchangeability (NI) identifies the equivalent values in the domain of a variable of a Constraint Satisfaction Problem (CSP) by considering only the constraints that directly apply to the variable. Freuder described an algorithm for efficiently computing NI values in binary CSPs. In this paper, we show that the generalization of this algorithm to non-binary CSPs is not straightforward, and introduce an efficient algorithm for computing. NI values in the presence of non-binary constraints. Further, we show how to interleave this mechanism with search for solving CSPs, thus yielding a dynamic bundling strategy. While the goal of dynamic bundling is to produce multiple robust solutions, we empirically show that it does not increase (but significantly decreases) the cost of search.
A Virtual Smart Tongue for Multifrequency Large Amplitude Pulse Voltammetry
Authors: Hai-Jun Zhong, Shao-Ping Deng, Shi-Yi Tian
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The design and application of a virtual Smart Tongue suitable for multifrequency large amplitude pulse voltammetry (MLAPV) was presented. The instrument consisted of a particular electrochemical sensor array; a self-assembled signal conditioning unit; a data acquisition card (DAQ card), and a personal compute (PC) with LabVIEW programming. A graphical user interface was developed to control, convert the sensor current to a digital value and send it to PC. Then the principal component analysis unit was used for processing data. Seven different Masterkong tea beverages were analyzed to evaluate the performance of system. The result shows that the proposed equipment has good discrimination ability for tea beverages. It also proves that the design of smart tongue based on virtual instrument technology is feasible.
Identification and simulation of a spatial ecological model in a lake with fractal boundary
Authors: Chiara Mocenni, Emiliano Sparacino
Venue: Mathematics and Computers in Simulation (2009)

We propose a 2D ecological model of phytoplankton dynamics accounting for the distribution and the evolution of algae in a large basin located in the Amazonian region. The model is described by a set of reaction-drift-diffusion equations and is driven by several exogenous inputs, such as wind velocity and direction, water temperature and solar radiation. Due to the roughness of the domain, a preliminary boundary extraction with a curvelet algorithm is performed. Then, the model is simulated in an approximated domain, where the contour has been reconstructed by estimating a set of Recurrent Fractal Interpolation Functions, aimed at preserving its fractal structure. Simulations are combined with time and space chlorophyll-a data in order to estimate the parameters of the model. The proposed algorithm is based on an iterative two-step identification procedure, where reaction parameters are recovered first and then used for estimating diffusion and transport parameters. Comparison results at different accuracy approximations and before and after the algorithm implementation are presented and discussed.
SVis: A Computational Steering Visualization Environment for Surface Structure Determination
Authors: J. Hernando, J. Martinez, V. Martin, M. F. Lopez, J. A. Martin-Gago
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

The arrangement of atoms at the surface of a solid accounts for many of its properties:Hardness, chemical activity, corrosion, etc. are dictated by the precise surface structure. Hence, finding it, has a broad range of technical and industrial applications. The ability to solve this problem opens the possibility of designing by computer materials with properties tailored to specific applications. Since the search space grows exponentially with the number of atoms, its solution cannot be achieved for arbitrarily large structures. Presently, a trial and error procedure is used: an expert proposes an structure as a candidate solution and tries a local optimization procedure on it. The solution relaxes to the local minimum in the attractor basin corresponding to the initial point, that might be the one corresponding to the global minimum or not. This procedure is very time consuming and, for reasonably sized surfaces, can take many iterations and much effort from the expert. Here we report on a visualization environment designed to steer this process in an attempt to solve bigger structures and reduce the time needed. The idea is to use an immersive environment to interact with the computation. It has immediate feedback to assess the quality of the proposed structure in order to let the expert explore the space of candidate solutions. The visualization environment is also able to communicate with the de facto local solver used for this problem. The user is then able to send trial structures to the local minimizer and track its progress as they approach the minimum. This allows for simultaneous testing of candidate structures. The system has also proved very useful as an educational tool for the field.
On the Structure of Optimal Greedy Computation (for Job Scheduling)
Authors: Periklis A. Papakonstantinou
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We consider Priority Algorithm [4] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority algorithms. A Job Scheduling subproblem $\mathbb{S}$ is determined by a (possibly infinite) set of jobs, every finite subset of which potentially forms an input to a scheduling algorithm. An algorithm is optimal for $\mathbb{S}$, if it gains optimal profit on every input. To the best of our knowledge there is no previous work about such arbitrary subproblems of Job Scheduling. For a finite $\mathbb{S}$, it is coNP-hard to decide whether $\mathbb{S}$ admits an optimal priority algorithm [12]. This indicates that meaningful characterizations of subproblems admitting optimal priority algorithms may not be possible. In this paper we consider those $\mathbb{S}$ that do admit optimal priority algorithms, and we show that the way in which all such algorithms compute has non-trivial and interesting structural features.
Approximation of fuzzy context-free grammars
Authors: Yongbing Wang, Yongming Li
Venue: Information Sciences: an International Journal (2009)

Fuzzy context-free max-* grammar (or FCFG"*, for short), as a straightforward extension of context-free grammar, has been introduced to express uncertainty, imprecision, and vagueness in natural language fragments. Li recently proposed the approximation of fuzzy finite automata, which may effectively deal with the practical problems of fuzziness, impreciseness and vagueness. In this paper, we further develop the approximation of fuzzy context-free grammars. In particular, we show that a fuzzy context-free grammar under max-* compositional inference can be approximated by some fuzzy context-free grammar under max-min compositional inference with any given accuracy. In addition, some related properties of fuzzy context-free grammars and fuzzy languages generated by them are studied. Finally, the sensitivity of fuzzy context-free grammars is also discussed.
Towards intelligent search assistance for inquiry-based learning
Authors: Weijian Xuan, Meilan Zhang
Venue: Proceedings of the second workshop on Building Educational Applications Using NLP (2005)

In Online Inquiry-Based Learning (OIBL) learners search for information to answer driving questions. While learners conduct sequential related searches, the search engines interpret each query in isolation, and thus are unable to utilize task context. Consequently, learners usually get less relevant search results. We are developing a NLP-based search agent to bridge the gap between learners and search engines. Our algorithms utilize contextual features to provide user with search term suggestions and results re-ranking. Our pilot study indicates that our method can effectively enhance the quality of OIBL.
Sputtered metal lift-off for grating fabrication on InP based optical devices
Authors: Liubov Magdenko, Fabien Gaucher, Abdel Aassime, Mathias Vanwolleghem, Philippe Lecoeur, Béatrice Dagens
Venue: Microelectronic Engineering (2009)

Sputtered metal gratings have been realized using lift-off process based on bilayer resist electron beam lithography (EBL). The lithography mask is composed of PMMA (poly(methylmethacrylate)) layer deposited under HSQ (hydrogen silsesquioxane) inorganic resist. EBL is performed in HSQ, whereas PMMA is used to ease final lift-off. We demonstrate the possibility of patterning by lift-off metals with different sputtering yields and deposition conditions. Gratings with period of 200nm and filling factor of 50% are obtained.
Howe's Method for Calculi with Passivation
Authors: Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We show how to apply Howe's method for the proof of congruence of early bisimilarities in a higher-order process calculus with passivation. This involves the introduction of a proof technique based on a new kind of transition system and bisimilarity, called complementary semantics. We show that complementary semantics is equivalent to contextual semantics, originally introduced by Sangiorgi, that relies on classical transition systems for higher-order calculi and context bisimilarity. We apply this technique to obtain the first characterization of weak barbed congruence for such a higher-order calculus with passivation.
Verification, Testing and Statistics
Authors: Sriram K. Rajamani
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

Formal verification is the holy grail of software validation. Practical applications of verification run into two major challenges. The first challenge is in writing detailed specifications, and the second challenge is in scaling verification algorithms to large software. In this talk, we present possible approaches to address these problems: We propose using statistical techniques to raise the level of abstraction, and automate the tedium in writing detailed specifications. We present our experience with the Merlin project [4], where we have used probabilistic inference to infer specifications for secure information flow, and discovered several vulnerabilities in web applications. We propose combining testing with verification to help scalability, an reducing false errors. We present our experience with the Yogi project [1,2,3,5], where we have built a verifier that combines static analysis with testing to find bugs and verify properties of low-level systems code.
A New Method of Hybrid Color Space and Its Application
Authors: Yejing Cai, Yonghong Long
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In pharmaceutical packaging, tablet inspection is an important part of safety and quality standard. Image segmentation is the key process for visual inspection. To improve accuracy and robustness of segmentation, in this paper, a method to construct a hybrid color space for the color tablet images by selecting a set of color components is introduced. Such space leads to a better discriminating power than classical color spaces, Image segmentation results based on gray level, RGB and hybrid color spaces are analyzed. Experimental results demonstrate that edges of tablets are accurately extracted in segmented image based on hybrid color space. This helps overcome the influence of non-uniform illumination.
Accelerating AES with Vector Permute Instructions
Authors: Mike Hamburg
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data- and key-dependent branches and memory references, they are immune to known timing attacks. This is the first constant-time software implementation of AES which is efficient for sequential modes of operation. This work can be adapted to several other primitives using the AES S-box such as the stream cipher LEX, the block cipher Camellia and the hash function Fugue. We focus on Intel's SSSE3 and Motorola's Altivec, but our techniques can be adapted to other systems with vector permute instructions, such as the IBM Xenon and Cell processors, the ARM Cortex series and the forthcoming AMD "Bulldozer" core.
Statistical measures of the semi-productivity of light verb constructions
Authors: Suzanne Stevenson, Afsaneh Fazly, Ryan North
Venue: Proceedings of the Workshop on Multiword Expressions: Integrating Processing (2004)

We propose a statistical measure for the degree of acceptability of light verb constructions, such as take a walk, based on their linguistic properties. Our measure shows good correlations with human ratings on unseen test data. Moreover, we find that our measure correlates more strongly when the potential complements of the construction (such as walk, stroll, or run) are separated into semantically similar classes. Our analysis demonstrates the systematic nature of the semi-productivity of these constructions.
Resource Competition and Synchronization in Membranes
Authors: Bogdan Aman, Gabriel Ciobanu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

In the enhanced mobile membranes, a membrane may enter or exitanother membrane. The second membrane just undergoes the action,meaning that it has no control on when the movement takes place.This kind of movement illustrates the lack of an agreement(synchronization) similar to an asynchronous evolution. In safeenhanced mobile membranes this aspect is adjusted: any movementtakes place only if both participants agree by synchronizing theirevolution. In membranes two kinds of competition can occur: resourcecompetition and location competition. Resource competition refersto rules which request the same resources, and the availableresources can only be allocated to some of the rules. Locationcompetition refers to the movement of a membrane in the hierarchicalstructure of the membrane systems under the request of some conflictrules. We use the two variants of membrane systems in order todescribe and explain these kinds of competition, and introducesynchronizing objects in safe enhanced mobile membranes to solve theresource and location competitions.
An Almost Optimal Rank Bound for Depth-3 Identities
Authors: Nitin Saxena, C. Seshadhri
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

We show that the rank of a depth-$3$ circuit (over any field) that is simple, minimal and zero is at most $O(k^3\log d)$. The previous best rank bound known was $2^{O(k^2)}(\log d)^{k-2}$ by Dvir and Shpilka (STOC 2005). This almost resolves the rank question first posed by Dvir and Shpilka (as we also provide a simple and minimal identity of rank $\Omega(k\log d)$). Our rank bound significantly improves (dependence on $k$ exponentially reduced) the best known deterministic black-box identity tests for depth-$3$ circuits by Karnin and Shpilka (CCC 2008). Our techniques also shed light on the factorization pattern of nonzero depth-$3$ circuits, most strikingly: the rank of linear factors of a simple, minimal and nonzero depth-$3$ circuit (over any field) is at most $O(k^3\log d)$. The novel feature of this work is a new notion of maps between sets of linear forms, called \emph{ideal matchings}, used to study depth-$3$ circuits. We prove interesting structural results about depth-$3$ identities using these techniques. We believe that these can lead to the goal of a deterministic polynomial time identity test for these circuits.
Simulation Design and Application of Music Playing Robot Based on SolidWorks
Authors: Tingjun Wang, Shenshun Hu, Jun Xu, Dewei Yan, Jiawen Bi
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In accordance with the requirement of playing music, a music playing robot for performing a piece on a xylophone is developed. The principle and technique of simulation design is introduced. Three dimensions model of the robot is built by SolidWorks software. Parameterized design, virtual assembly, motion simulation and optimization design of the robot have been discussed. Diagrammatic curve of motion analyses is introduced. Displacement curves and velocity curves are given. And its control system is designed. The results indicate that the music playing robot with a single ballet can preferably imitate a hand to play music by beating keys of a xylophone. It has simple structure, agile motion and accurate playing positioning. The simulation modeling and virtual assembly of xylophone, mallet-moving unit, mallet-beating unit and bracket can detect problem on structure in design. Transmission relations, interference check-up and motion simulation ensure to accord preestablished movement project of the robot. Simulation design shortens design period and enhances design efficiency.