ppxscal/embedding_network huggingface dataset:
Time-Bounded Kolmogorov Complexity and Solovay Functions
Authors: Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

A Solovay function is a computable upper bound g for prefix-free Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constant, on infinitely many places n. We obtain natural examples of Solovay functions by showing that for some constant c 0 and all computable functions t such that c 0 n ≤ t(n), the time-bounded version K t of K is a Solovay function.By unifying results of Bienvenu and Downey and of Miller, we show that a right-computable upper bound g of K is a Solovay function if and only if ¿ g is Martin-Löf random. Letting $\mathrm{\Omega}_g=\sum 2^{-g(n)}$, we obtain as a corollary that the Martin-Löf randomness of the various variants of Chaitin's ¿ extends to the time-bounded case in so far as $\mathrm{\Omega}_{K^t}$ is Martin-Löf random for any t as above.As a step in the direction of a characterization of K-triviality in terms of jump-traceability, we demonstrate that a set A is K-trivial if and only if A is Og(n) ¿ K(n)-jump traceable for all Solovay functions g, where the equivalence remains true when we restrict attention to functions g of the form K t , either for a single or all functions t as above.Finally, we investigate the plain Kolmogorov complexity C and its time-bounded variant C t of initial segments of computably enumerable sets. Our main theorem here is a dichotomy similar to Kummer's gap theorem and asserts that every high c.e. Turing degree contains a c.e. set B such that for any computable function t there is a constant c t > 0 such that for all m it holds that C$^t(B\upharpoonright m) \geq c_t \cdot m$, whereas for any nonhigh c.e. set A there is a computable time bound t and a constant c such that for infinitely many m it holds that C$^t(A\upharpoonright m) \leq \log m + c$. By similar methods it can be shown that any high degree contains a set B such that C$^t(B\upharpoonright m) \geq^+ m/4$. The constructed sets B have low unbounded but high time-bounded Kolmogorov complexity, and accordingly we obtain an alternative proof of the result due to Juedes, Lathrop, and Lutz [JLL] that every high degree contains a strongly deep set.
Solving All-to-All Communication with CA Agents More Effectively with Flags
Authors: Patrick Ediger, Rolf Hoffmann
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

We have investigated the all-to-all communication problem for a multi-agent system modeled in cellular automata. The agents' task is to solve the problem by communicating their initially mutually exclusive information to all the other agents. In order to evolve the best behavior of agents with a uniform rule we used a set of 20 initial configurations, 10 with border, 10 with cyclic wrap-around. The behavior was evolved by a genetic algorithm for agents with (1) simple moving abilities, (2) for agents with more sophisticated moving abilities and (3) for agents with indirect communication capabilities (reading and writing flags into the environmental cells). The results show that the more sophisticated agents are not only more effective but also more efficient regarding the effort that has to be made finding a feasible behavior with the genetic algorithm.
Annotated Corpus of Polish Spoken Dialogues
Authors: Agnieszka Mykowiecka, Krzysztof Marasek, Małgorzata Marciniak, Joanna Rabiega-Wiśniewska, Ryszard Gubrynowicz
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

The paper presents a corpus of Polish spoken dialogues being a result of the LUNA (spoken Language UNderstanding in multilinguAl communication systems) project. We describe the process of collecting the corpus and its annotation on several levels, from transcription of dialogues and their morphosyntactic analysis, to semantic annotation on concepts and predicates. Annotation on the morphosyntactic and semantic levels was done automatically and then manually corrected. At the concept level, the annotation scheme comprises about 200 concepts from an ontology designed specially for the project. The set of frames for predicate level annotation was defined as a FrameNet-like resource.
The Energy Distribution Data Bank: Collecting Energy Features of Protein Molecular Structures
Authors: Dariusz Mrozek, Bozena Malysiak-Mrozek, Stanislaw Kozielski, Andrzej Swierniak
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

The analysis of structural and energy features of proteins can be a key to understand how proteins work and interact to each other in cellular reactions. Potential energy is a function of atomic positions in a protein structure. The distributions of energy over each atom in protein structures can be very supportive for the studies of the complex processes proteins are involved in. Energy profiles contain distributions of different potential energies in protein molecular structures. Therefore, they constitute a full descriptor of energy properties for protein structures. The Energy Distribution Data Bank (EDB, http://edb.aei.polsl.pl) stores energy profiles for protein molecular structures retrieved from the well-known Protein Data Bank. In the paper, we describe the purpose of the EDB, a possible use of the information stored in it, query possibilities, and plans for future development.
Three-Dimension Visual Simulation System Based on Satellites Formation with Satellite-Borne GPS
Authors: Chen Mingjian, Zhou Fengqi, Hao Jinming, Yi Weiyong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The three-dimension simulation of satellites formation is a system engineering. It can give intuitive graphics by 3D views and intuitive data by database, which convenient for our research. For this, we designed simulation system process chart and other diagrams. In this paper, we take the simulation of space circle formation for satellites as an example. Using dynamic equation and OpenGL, the relative positions,space trajectory and ground track of formation satellite can be viewed and the visibility GPS constellations is simulated. Using SQL server 2000, we can call the data at any moment which can be reference data for relative navigation algorithmic. The software can be used as a basic tools for designing formation flying and selecting the relatively navigation algorithm of formation flying.
Implement TSK Model Using a Self-constructing Fuzzy Neural Network
Authors: Yao Yuan, Zhang Kailong, Zhou Xinshe
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

This paper proposes an approach to implement TSK model by using a self-constructing fuzzy neural network (SCFNN). This network is built based on ellipsoidal basis function (EBF), which can be divided into two parts. The first hidden layer composed of EBF units is considered as IF-part, and the output layer which consists of the connect weights is the THEN-part. The structure of SCFNN can adjust adaptively by a new structure learning algorithm based on the proposed crucial factor which denotes the importance of a fuzzy rule. Thus, a rule can be generated or pruned automatically according to both the firing strength of the rule and the performance of SCFNN. Simulation results show that the SCFNN has the powerful capability to extract fuzzy rules in the network. Comprehensive comparisons with other approaches indicate that the proposed method is better considering the learning efficiency and actual effect.
Forensic Authorship Attribution Using Compression Distances to Prototypes
Authors: Maarten Lambers, Cor J. Veenman
Venue: Proceedings of the 3rd International Workshop on Computational Forensics (2009)

In several situations authors prefer to hide their identity. In forensic applications, one can think of extortion and threats in emails and forum messages. These types of messages can easily be adjusted, such that meta data referring to names and addresses is at least unreliable. In this paper, we propose a method to identify authors of short informal messages solely based on the text content. The method uses compression distances between texts as features. Using these features a supervised classifier is learned on a training set of known authors. For the experiments, we prepared a dataset from Dutch newsgroup texts. We compared several state-of-the-art methods to our proposed method for the identification of messages from up to 50 authors. Our method clearly outperformed the other methods. In 65% of the cases the author could be correctly identified, while in 88% of the cases the true author was in the top 5 of the produced ranked list.
An implementation of robot formations using local interactions
Authors: Ross Mead, Jerry B. Weinberg, Jeffrey R. Croxell
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Coordinating a group of robots to work in formation has been suggested for a number of tasks, such as urban search-and-rescue, traffic control, and harvesting solar energy. Algorithms for controlling robot formations have been inspired by biological and organizational systems. In our approach to robot formation control, each robot is treated like a cell in a cellular automaton, where local interactions between robots result in a global organization. The algorithm has been demonstrated in simulation. In this paper, we present a physical implementation.
Investigation of growth properties of patterned and aligned carbon nanotubes for field emitter
Authors: Hongzhong Liu, Yongsheng Shi, Yucheng Ding, Bingheng Lu
Venue: Microelectronic Engineering (2009)

We demonstrate the use of microstructures as an inducement for the growth of patterned and aligned carbon nanotubes (CNTs) during thermal chemical vapor deposition process. The growth of individual nanotube lines of vertical-standing 8-10@mm length can be controlled in almost any directions. In directions of approximate 90^o, 60^o, 45^o or 0^o relative to substrate surface, kinds of aligned CNTs patterns were synthesized. We also show that the flow of carrier gas and apical dominance like plant growth are the main factors of patterning CNTs, which indicates that the distribution of electric field can be controlled and the shielding effects can be weakened. The result establishes a method of patterned and aligned nanotubes, which is well suited for ordered arrays of CNTs field emitters. The field emission currents were observed to be fairly reproducible ranging from 375 to 1000V and field emission measurements show a low turn-on field (1.25V/@mm).
Review of Communication Systems for Ingestible Miniaturized Integrated Sensor Microsystems
Authors: N. Aydin, T. Arslan
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

Recently, there is a growing interest for miniaturized telemetry systems for a variety of biomedical applications such as the development of wireless sensor systems that can be integrated into a noninvasive capsule format to perform endoscopic functions within the gastrointestinal tract. An important issue in such systems is the real time transmission of the data out of body wirelessly. Developments in system-on-chip and wireless technologies have led to complex electronic systems to be miniaturized to size of ingestible capsule and implantable microsystems. Inevitably such miniaturized complex systems impose some constraints on the case of an ingestible diagnostic capsule. It is desirable that system be wireless, programmable, and reusable. In this paper, we review some possible wireless interface methods and describe a programmable wireless direct sequence spread spectrum link developed for such an ingestible microsystem.
Resource Usage Analysis and Its Application to Resource Certification
Authors: Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini
Venue: Foundations of Security Analysis and Design V: FOSAD 2007/2008/2009 Tutorial Lectures (2009)

Resource usage is one of the most important characteristics of programs. Automatically generated information about resource usage can be used in multiple ways, both during program development and deployment. In this paper we discuss and present examples on how such information is obtained in COSTA, a state of the art static analysis system. COSTA obtains safe symbolic upper bounds on the resource usage of a large class of general-purpose programs written in a mainstream programming language such as Java (bytecode). We also discuss the application of resource-usage information for code certification, whereby code not guaranteed to run within certain user-specified bounds is rejected.
Textile Flaw Detection and Classification by Wavelet Reconstruction and BP Neural Network
Authors: Yean Yin, Wen Bing Lu, Ke Zhang, Liang Jing
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

This paper presents a method of textile flaw detection and classification based on wavelet reconstruction and BP neural network. The common two types of textile flaws, namely oil stain and hole, can be detected and classified. The method can handle two types of texture fabrics: statistical textures with isotropic patterns and structural textures with oriented patterns. For the extraction of flaw features, histograms of "hole" and "oil stain" are computed as the input of BP neural network. Some samples are selected for testing, the results show that the proposed method can effectively detect defects and classify the types of defect with high recognition correct rate.
A Clock Fault Detection Circuit for Reliable High Speed System by Time-to-Voltage Conversion
Authors: Changhong Yu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

A novel architecture for clock fault detection circuit for high speed nanoelectronics system is delivered. Time-to-voltage converter is employed for transforming error of time to the error of voltage which is more convenient for error detection. The rapid discharging circuit is also used for system resetting. To illustrate the detection capability by the diction circuit, a prototype CMOS design of this proposed circuit is presented. Simulation result shows that the proposed architecture is very suit for integration to nanoelectronic circuit design to detect the fault of the clock.
Improved syntactic models for parsing speech with repairs
Authors: Tim Miller
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

This paper introduces three new syntactic models for representing speech with repairs. These models are developed to test the intuition that the erroneous parts of speech repairs (reparanda) are not generated or recognized as such while occurring, but only after they have been corrected. Thus, they are designed to minimize the differences in grammar rule applications between fluent and disfluent speech containing similar structure. The three models considered in this paper are also designed to isolate the mechanism of impact, by systematically exploring different variables.
GRASP and path relinking for the max-min diversity problem
Authors: M. G. C. Resende, R. Martí, M. Gallego, A. Duarte
Venue: Computers and Operations Research (2010)

The max-min diversity problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method-based on the GRASP and path relinking methodologies-for finding approximate solutions to this optimization problem. We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary path relinking. Empirical results indicate that the proposed hybrid implementations compare favorably to previous metaheuristics, such as tabu search and simulated annealing.
Transform the Management of the Commercial Banks in China with a Balanced Scorecard and BI-Centralized Performance System
Authors: Liu Yuanxin, Ren Jing, Jin Hui
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Affected by the global financial turmoil and the dynamic macro-economic,the commercial banks in China are confronting serious chanllenges. In order to address the challenges, this article analyze the way to transform the commercial banks to be management excellent companies and then propose a performance system centralized with the balanced scorecard and business intelligence to help build the commercial banks to be smart, agile, aligned and lean.
Rover science autonomy: probabilistic planning for science-aware exploration doctoral consortium thesis summary
Authors: Trey Smith
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

Future Mars rovers will have the ability to autonomously navigate for distances of kilometers. In one sol a traverse may take a rover into unexplored areas beyond its local horizon. The rover can explore these areas more effectively if it is able to detect and react to science opportunities on its own, what we call science autonomy. We are studying science autonomy in two ways: first, by implementing a simple science autonomy system, In a rover in the field, and second, by developing probabilistic planning technology that can enable more principled autonomous decision-making in future systems.
Knowledge and learning claims in blog conversations: a discourse analysis in social psychology (DASP) perspective
Authors: Trena Paulus, Kathy Evans, Olivia Halic, Jessica Lester, Jonathan Taylor, Marsha Spence
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This paper explores how discourse analysis in social psychology (DASP) can provide CSCL researchers with insights regarding how students perform knowing and learning. We investigated what counted as knowledge and learning as students in a large undergraduate lecture course shared their understandings of dietary supplements through blog conversations.
A Collaborative Modeling Platform Based on Public Key Infrastructure
Authors: Wuzheng Tan, Maojiang Yang, Feng Ye, Wei Ren
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

We propose a human modeling framework based on public key infrastructure and illustrate it with the implemented software that can be used as a core part for different real life applications. It is possible to perform their collaborative interactive modifications with concurrent synchronous visualization at each client computer with any required safety level of detail. The platform provides a muscle modeling and encryption transferring environment. The platform is illustrated for human muscle modeling and assembling analysis as an example, and provides a collaborative and encryption environment for the model of products, aiming at encryption, decryption and cipher text transferring.
Using spatial language in multi-modal knowledge capture
Authors: Kate Lockwood
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The ability to understand and communicate spatial relationships is central to many human-level reasoning tasks. People often describe spatial relationships using prepositions (i.e., in, on, under). Being able to use and interpret spatial prepositions could help create interactive systems for many tasks, including knowledge capture. Here I describe my thesis work modeling the learning and use of spatial prepositions and applying this model to the task of knowledge capture.
Reinforcement Learning Using Kohonen Feature Map Associative Memory with Refractoriness Based on Area Representation
Authors: Atsushi Shimizu, Yuko Osana
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

In this paper, we propose a reinforcement learning method using Kohonen Feature Map Associative Memory with Refractoriness based on Area Representation. The proposed method is based on the actor-critic method, and the actor is realized by the Kohonen Feature Map Associative Memory with Refractoriness based on Area Representation. The Kohonen Feature Map Associative Memory with Refractoriness based on Area Representation is based on the self-organizing feature map, and it can realize successive learning and one-to-many associations. Moreover, it has robustness for noisy input and damaged neurons because it is based on the area representation. The proposed method makes use of this property in order to realize the learning during the practice of task. We carried out a series of computer experiments, and confirmed the effectiveness of the proposed method in path-finding problem.