ppxscal/embedding_network huggingface dataset:
Plenary lecture I: a life time dedicated to acoustics
Authors: Radu P. Voinea
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

I want to do a special mention related to the activity of professor Aurelian Stan in the field of acoustics, particularly about the activity as scientific secretary, vice-president and president of the Commission of Acoustics of the Romanian Academy. The activity of scientific research of professor Aurelian Stan consists of over 200 books, studies, papers, communications, yielding original contributions in the domain of acoustics: noise control and vibrations at ships, elevators and in the textile industry; acoustics treatment of the industrial places; using the noise absorbing ceilings; acoustics of the performance halls, particularly, acoustics of the National Theatre Hall; study of the noise produced by town traffic, particularly in Bucharest; papers useful in military area, in the domain of infrasound, vibrations of the pipes of anti-aircraft guns, acoustics of underwater for the detection of the submarines, etc. I have always been impressed by the care of professor Aurelian Stan concerning the elaboration of the 30 volumes of scientific communications made at the annual sessions of this commission, from 1972 until 2002, so modestly named "Note-Books of acoustics". I admired him examining very carefully every communication separately, the way he talked to the author, often a young and less experienced person in the technique of elaboration and he used to give useful advice to this youth. I know he would not have accepted any communication if it had not met the exigencies of a publication of the Romanian Academy. For special scientific results, in 1943, the professor Aurelian Stan was elected corresponding member of the Romanian Academy of Science, an academy founded in the '30 and functioned parallel to the Romanian Academy. In 1993, on 23rd of March, he was elected member of honour of the Romanian Academy. In 1995, professor Aurelian Stan founded The Romanian Acoustical Society, he being among the founding members. In 1997, he became founding member of the Academy of Technical Sciences in Romania (ASTR). His activity was appreciated especially by some prestigious scientific societies from abroad. Thus, in 1974 he was elected member of the Group of Acousticians speaking French Language (GALF). In 1976, he became member of the European Acoustics Society (FASE), being elected vice-president of this prestigious society in 1982. Let's add to all these the fact that in 1979 he was awarded the silver medal of the French Acoustics Society and in 1980, this society conferred him the title of member of honor.
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
Authors: Dervis Karaboga, Bahriye Basturk
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

This paper presents the comparison results on the performance of the Artificial Bee Colony (ABC) algorithm for constrained optimization problems. The ABC algorithm has been firstly proposed for unconstrained optimization problems and showed that it has superior performance on these kind of problems. In this paper, the ABC algorithm has been extended for solving constrained optimization problems and applied to a set of constrained problems .
Agents Based Hierarchical Parallelization of Complex Algorithms on the Example of hp Finite Element Method
Authors: M. Paszyński
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The paper presents how application of agents can improve scalability of domain decomposition (DD) based parallel codes, where the optimal load balance for some components of the code cannot be achieved only by partitioning computational domain. The limitation of the DD paradigm, where some highly overloaded pieces of domain cannot be partitioned into smaller sub-domains can be effectively overcome by parallelization of computational algorithm over these pieces. The agents are used to localize such highly loaded unbreakable parts of domain. Multiple agents are then assign to each highly loaded part to execute computational algorithm in parallel. The resulting hierarchical parallelization scheme results in the significant improvement of the scalability. The proposed agent based hierarchical parallelization scheme has been successfully tested on a very complex hp Finite Element Method (FEM) parallel code, applied for simulating Step-and-Flash-Imprint Lithography (SFIL), resistance heating of Al-Si billet in steel die for tixoforming process as well as for the Fichera model problem.
Open source content contributors' response to free-riding: The effect of personality and context
Authors: Oded Nov, George Kuk
Venue: Computers in Human Behavior (2008)

We address concerns about the sustainability of the open source content model by examining the effect of external appropriation, whereby the product of open source contributors' efforts is monetized by a party that did not contribute to the project, on intended effort withdrawal (reduction in contribution level). We examine both the personality of contributors and their contextual motivations to contribute, using a scenario-based survey of Wikipedia contributors. The findings suggest that perceived justice of the open source license terms, and intrinsic motivations are both negatively related with effort withdrawal intentions. Moreover, we find that the effect of the fairness personality trait on effort withdrawal is stronger for individuals who are low in perceived justice and weaker for individuals high in justice. The findings of factors predicting effort withdrawal contribute to the open source literature, which tends to focus on contribution and motivations, but not on what impacts changes in individual contribution levels.
Distributed Cutting Algorithm of Remote Sensing Images on Internet
Authors: Qingquan Tan, Jiantao Bi, Tianhe Chi, Qun Liu, Liguang Ma
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

With the progress of researches on the integration of Geographic Information System (GIS) and Remote Sensing (RS), digital earth, and information sharing, to publish RS images on Internet has become a significant research work. This paper presents an efficient algorithm to build image pyramid model for convenient data storage and retrieval and proposes two distributed cutting algorithms under the Internet environment, which are programmed in Java and C++ languages, based on B/S and C/S architecture respectively. Some useful functions, such as data compression, image format transformation, watermarking, and automated error-correction, are also implemented. The programs are robust, efficient, and easy to use, endowed with user-friendly graphical interface. Tests of the programs with a global RS image show good results. Therefore the image publication on Internet becomes easier to accomplish.
Structure Discovery from Massive Spatial Data Sets Using Intelligent Simulation Tools
Authors: Feng Zhao, Chris Bailey-Kellogg, Xingang Huang, Iván Ordóñez
Venue: Computational Discovery of Scientific Knowledge: Introduction, Techniques, and Applications in Environmental and Life Sciences (2007)

Extracting structures as communicable knowledge is a central problem in spatio-temporal data analysis. Spatial Aggregation is an effective way for discovering structures. To address the computational challenges posed by applications such as weather data analysis or engineering optimization, Spatial Aggregation recursively aggregates local data into higher-level descriptions, exploiting the fact that these physical phenomena can be described as spatio-temporally coherent "objects" due to continuity and locality in the underlying physics. This paper uses several problem domains -- weather data interpretation, distributed control optimization, and spatio-temporal diffusion-reaction pattern analysis -- to demonstrate that intelligent simulation tools built upon the principles of Spatial Aggregation are indispensable for scientific discovery and engineering analysis.
The Domain-Specific Track at CLEF 2007
Authors: Vivien Petras, Stefan Baerisch, Maximillian Stempfhuber
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The domain-specific track uses test collections from the social science domain to test monolingual and cross-language retrieval in structured bibliographic databases. Special attention is given to the existence of controlled vocabularies for content description and their potential usefulness in retrieval. Test collections and topics are provided in German, English and Russian. This year, a new English test collection (from the CSA Sociological Abstracts database) was added. We present an overview of the CLEF domain-specific track including a description of the tasks, collections, topic preparation, and relevance assessments as well as contributions to the track. The track participants experimented with different retrieval models ranging from classic vector-space to probabilistic to language models. The controlled vocabularies were used for query expansion or as bilingual dictionaries for query translation.
A note on partially ordered tree automata
Authors: P. -C. Héam
Venue: Information Processing Letters (2008)

A recent paper by Bouajjani, Muscholl and Touili shows that the class of languages accepted by partially ordered word automata (or equivalently accepted by @S"2-formulae) is closed under semi-commutation and it suggested the following open question: can we extend this result to tree languages? This problem can be addressed by proving (1) that the class of tree regular languages accepted by @S"2 formulae is strictly included in the class of languages accepted by partially ordered automata, and (2) that Bouajjani and the others results cannot be extended to tree.
Computing Omega-Limit Sets in Linear Dynamical Systems
Authors: Emmanuel Hainry
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

Dynamical systems allow to modelize various phenomena or processes by only describing their way of evolution. It is an important matter to study the global and the limit behaviour of such systems. A possible description of this limit behaviour is via the omega-limit set: the set of points that can be limit of subtrajectories. The omega-limit set is in general uncomputable. It can be a set highly difficult to apprehend. Some systems have for example a fractal omega-limit set. However, in some specific cases, this set can be computed. This problem is important to verify properties of dynamical systems, in particular to predict its collapse or its infinite expansion. We prove in this paper that for linear continuous time dynamical systems, it is in fact computable. More, we also prove that the ¿-limit set is a semi-algebraic set. The algorithm to compute this set can easily be derived from this proof.
FPGA-based system for frequency detection of the main periodic component in time series information
Authors: E. Cabal-Yepez, T. D. Carozzi, R. de J. Romero-Troncoso, M. P. Gough, N. Huber
Venue: Digital Signal Processing (2008)

This paper presents a novel algorithm, called the DFSWT, and its FPGA-based hardware processing unit for frequency estimation of a time series main periodic component. Since the DFSWT uses just additions and subtractions, it is simpler to compute than the FFT, and since its spectrum is a frequency function, it is more intuitive than the Walsh transform. The results show that the proposed algorithm is very efficient in detecting the frequency of the main periodic component, even in low SNR. The proposed hardware processing unit is 3 orders of magnitude faster than its respective software implementation and presents advantages regarding to power consumption, footprint, and computation speed against highly optimized commercially available FFT cores.
Premature Convergence in Constrained Continuous Search Spaces
Authors: Oliver Kramer
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

The optimum of numerical problems quite often lies on the constraint boundary or even in a vertex of the feasible search space. In such cases the evolutionary algorithm (EA) frequently suffers from premature convergence because of a low success probability near the constraint boundaries. We analyze premature fitness stagnation and the success rates experimentally for an EA using self-adaptive step size control. For a (1+1)-EA with a Rechenberg-like step control mechanism we prove premature step size reduction at the constraint boundary. The proof is based on a success rate analysis considering a simplified mutation distribution model. From the success rates and the possible state transitions, the expected step size change can be derived at each step. We validate the theoretical model with an experimental analysis.
Evolution of the (hyper)polarizability with the size and periodicity of the system. A model investigation from the LiF molecule to the LiF 3D crystal
Authors: M. Rérat, M. Ferrero, R. Dovesi
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

A finite field (FF) perturbation method, implemented in the CRYSTAL program, is used to investigate the evolution of the response to an applied electric field of systems of increasing size and dimensionality. LiF molecules, chains, slabs and bulk have been considered as model systems. (LiF)$_M$ molecules of increasing length are compared with the periodic infinite linear chain data; systems containing an increasing number of parallel linear chains are compared with the single layer slab, and slabs of increasing thickness are compared with bulk results. The same hamiltonian (Hartree-Fock), Li-F distance and basis set have been used for all systems. Sharp variations are observed in the response properties along the series (from the molecule to the 3D crystal), that are not the same for the parallel and perpendicular components of the tensors. In particular the (hyper)polarizability tensor components can vary by as much as a factor 8.
Endomorphisms for Non-trivial Non-linear Loop Invariant Generation
Authors: Rachid Rebiha, Nadir Matringe, Arnaldo Vieira Moura
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Present approaches for non-linear loop invariant generation are limited to linear (affine) systems, or they relay on non scalable methods which have high complexity. Moreover, for programs with nested loops and conditional statements that describe multivariate polynomials or multivariate fractional systems, no applicable method is known to lend itself to non-trivial non-linear invariants generation. We demonstrate a powerful computational complete method to solve this problem. Our approach avoids first-order quantifier elimination, cylindrical algebraic decomposition and Grobner bases computation, hereby circumventing difficulties met by recent methods.
Diameter-sufficient conditions for a graph to be super-restricted connected
Authors: Camino Balbuena, Yuqing Lin, Mirka Miller
Venue: Discrete Applied Mathematics (2008)

A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G-X must have at least two vertices. The restricted connectivity @k^'(G) of a connected graph G is defined as the minimum cardinality of a restricted cut. Additionally, if the deletion of a minimum restricted cut isolates one edge, then the graph is said to be super-restricted connected. In this paper, several sufficient conditions yielding super-restricted-connected graphs are given in terms of the girth and the diameter. The corresponding problem for super-edge-restricted-connected graph is also studied.
An Experimental Evaluation of the New OpenMP Tasking Model
Authors: Eduard Ayguadé, Alejandro Duran, Jay Hoeflinger, Federico Massaioli, Xavier Teruel
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

The OpenMP standard was conceived to parallelize dense array-based applications, and it has achieved much success with that. Recently, a novel tasking proposal to handle unstructured parallelism in OpenMP has been submitted to the OpenMP 3.0 Language Committee. We tested its expressiveness and flexibility, using it to parallelize a number of examples from a variety of different application areas. Furthermore, we checked whether the model can be implemented efficiently, evaluating the performance of an experimental implementation of the tasking proposal on an SGI Altix 4700, and comparing it to the performance achieved with Intel's Workqueueing model and other worksharing alternatives currently available in OpenMP 2.5. We conclude that the new OpenMP tasks allow the expression of parallelism for a broad range of applications and that they will not hamper application performance.
Efficient Pairwise Classification
Authors: Sang-Hyeun Park, Johannes Fürnkranz
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Pairwise classification is a class binarization procedure that converts a multi-class problem into a series of two-class problems, one problem for each pair of classes. While it can be shown that for training, this procedure is more efficient than the more commonly used one-against-all approach, it still has to evaluate a quadratic number of classifiers when computing the predicted class for a given example. In this paper, we propose a method that allows a faster computation of the predicted class when weighted or unweighted voting are used for combining the predictions of the individual classifiers. While its worst-case complexity is still quadratic in the number of classes, we show that even in the case of completely random base classifiers, our method still outperforms the conventional pairwise classifier. For the more practical case of well-trained base classifiers, its asymptotic computational complexity seems to be almost linear.
The Giant Complex System Research Based on Fuzzy Theory and Intelligent Decision Support System IDSS
Authors: Aiming Wang, Lingxia Liu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Mankind is confronted with an increasingly complexsystem, especially the major decision issues, such asorganization and management, coordination, planning,forecasting, controlling and so on. Due to the complexityof the system, many fuzzy factors and the limitations of theexisting complex giant system theory, there are still manyproblems to be solved. The research on the giant complexsystem based on the theory of fuzzy decision theorytheoretically had been proving the reliability of the groupdecision and has established "the multi- judgmentsinformation" fuzzy synthesis computational method. It hasdesigned the corresponding multipurpose intelligentdecision support system IDSS.
Automatic Multi-criteria Assessment of Open-Ended Questions: A Case Study in School Algebra
Authors: Élisabeth Delozanne, Dominique Prévit, Brigitte Grugeon, Françoise Chenevotot
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper deals with authoring assessments of complex competence involving open-ended questions. We present, PépiGen, a multi-criteria automatic assessor for school algebra, via a walkthrough of an example. PépiGen is based on our previous work on Pépite, an automatic cognitive diagnosis tool that capitalizes on educational research results. From that prototype, we derived patterns of diagnosis tasks. A pattern models (i) a class of exercises, (ii) the different students' points of view on the solutions reported in the literature or observed in a corpus, (iii) and a multidimensional assessment for each solution approach. To adapt an assessment to a specific classroom context (e.g. level of difficulty, time, learning objectives) an interface allows an IT non expert (e.g. a teacher) to generate new instances of exercises by filling the pattern parameters. The originality of our research lies in the fact that our system generates the automatic analysis of students' simple or complex answers, such as algebraic reasoning. This is an ongoing work but preliminary evaluation shows that PépiGen is already successful in generating and analyzing most answers on several classes of problems.
Structure modifiable adaptive reason-building temporal bayesian network (smartbn): theory and application in human activity and three-dimensional vehicle modeling from video
Authors: Bir Bhanu
Venue:  (2007)

This dissertation proposes a novel data-driven continuously evolvable Bayesian Net (BN), namely Structure Modifiable Adaptive Reason-building Temporal BN (SmartBN). SmartBN considers very few causal relations, called causal templates, models the current evidence online by Expansion and Instantiation (EI) principle and keep on continuously self-modifying with the streaming information. It is the only current scalable probabilistic graphical framework to effectively model unpredictable dynamic systems or processes by systematic and incremental uncertainty handling. Several application areas, from economics to medical decision systems to database management to computer vision, are distinguished. Performance of SmartBN is reported on two computer vision applications, human activity analysis in streaming movie clips and incremental 3D model reconstruction of vehicles from unpredictable traffic video. SmartBN performance is shown for a complex movie clips with multiple characters and multiple activities based on body-part positions, relations among body-parts and changing relations across the frames. SmartBN based 3D model building uses a novel concept of Directional Template Library (DTL), one single generic 3D vehicle model and several videos of different vehicles in motion. DTL maps 2D features to 3D model parameters. EI principle uses the identified causal templates to instantiate the SmartBN online and keep on evolving it for new features and relations encountered. Performance of SmartBN in 3D model building is also compared with an incremental adaptive clustering based approach proposed in this work. The clustering based approach uses DTL and novel structural congruency (to the generic model) scores at multiple abstraction levels to incrementally reconstruct the 3D model of the vehicles. The SmartBN and clustering based approaches are compared for 3D model building application. SmartBN widens the scope of probabilistic graphical frameworks manifold, specifically the video-based computer vision systems.
Towards Ontology Evolution in Physics
Authors: Alan Bundy, Michael Chan
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We investigate the problem of automatically repairing inconsistent ontologies. A repair is triggered when a contradiction is detected between the current theory and new experimental evidence. We are working in the domain of physics because it has good historical records of such contradictions and how they were resolved. We use these records to both develop and evaluate our techniques. To deal with problems of inferential search control and ambiguity in the atomic repair operations, we have developed ontology repair plans, which represent common patterns of repair. They first diagnose the inconsistency and then direct the resulting repair. Two such plans have been developed to repair ontologies that disagree over the value and the dependence of a function, respectively. We have implemented the repair plans in the galileo system and successfully evaluated galileo on a diverse range of examples from the history of physics.