ppxscal/embedding_network huggingface dataset:
Impediments to general purpose Content Based Image search
Authors: Melanie A. Veltman, Michael Wirth, JingBo Ni
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

Challenges faced by prevailing text metadata paradigms for online image search have inspired overwhelming research in Content Based Image Retrieval (CBIR). A multitude of approaches have been introduced within the literature, yet relatively few image search engines have been made publicly available on the web. Aside from challenges facing the user, such as describing a visual query using keywords, or finding an appropriate example image to initiate a visual search, all systems must inevitably grapple with the sensory and semantic gaps [Smeulders et al. 2000], which essentially represent a loss of information in the abstraction process. In this work, we challenge commonly suggested approaches to improving CBIR and illustrate drawbacks of relying on textual data, as well as visual data, in general CBIR search. We provide cogent examples using online visual search engines Behold&trade;, Tiltomo Beta, Pixilimar, and Riya&trade; Beta. These examples demonstrate the effect of semantic ambiguities in natural language, which extend to search terms and text tags.
On some properties of fuzzy systems
Authors: Constantin Volosencu
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

The paper presents a short review of some main properties of fuzzy systems, useful in control and other applications. Fuzzy rule bases and fuzzy systems may be seen as applications between fuzzy or real sets, with algebraic properties as: commutative law, neutral element and symmetric elements. Fuzzy systems, developed with different rule bases, fuzzy values, membership functions, fuzzyfication and defuzzification methods may be characterised with SISO and MISO transfer characteristics. A spatial sector property, useful in the stability analysis with Lyapunov techniques, may be emphasised, on these characteristics. Also, the fuzzy systems have a variable gain with its inputs. The transfer characteristics and system linearization are usefull in the design of fuzzy PID controllers. Based on the transient characteristics we are showing that the control systems based on fuzzy PI controllers assure better quality criteria then the control systems based on linear PI controllers and they are more robust.
Supporting System for Design and Production with Sharing and Access of Product Failure
Authors: Kazuhiro Aoyama, Tsuyoshi Koga
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Since the product recall problem is recently observed, realizing design and production activities which can prevent occurrences of a product failure has been becoming a serious issue. This paper proposes “the Synthetic design approach of a product and a production process which enables to reduce occurrences of a product failure from the initial stage of a product development”. In order to realize this proposed concept as a specific system, the integrated model of the failure information in the design and production is introduced. This paper shows some examples of design and production for a circuit breaker and an automobile with considering a design error and a production failure using developed prototype system.
Effect of electronic flame off parameters on copper bonding wire: Free-air ball deformability, heat affected zone length, heat affected zone breaking force
Authors: C. J. Hang, W. H. Song, I. Lum, M. Mayer, Y. Zhou, C. Q. Wang, J. T. Moon, J. Persic
Venue: Microelectronic Engineering (2009)

Cu bonding wire is more and more used for interconnections to integrated circuits (ICs) to reduce cost and increase performance compared to Au wire. To eliminate underpad damage for Cu wire applications, it is worthwhile to reduce the hardness of the free-air ball (FAB). Short heat affected zone (HAZ) and high HAZ breaking load are often required for advanced microelectronics packaging in order to decrease the loop height and thereby the package thickness. Online measurements of deformability and HAZ breaking force at temperatures close to the bonding temperature of 220^oC are new tools used in this study to evaluate the effects of electronic flame off (EFO) current and firing time on the Cu FAB deformability and the HAZ length and tensile strength. FABs with 50@mm diameter formed from a 25@mm diameter Cu wire with a breaking load of 118.6mN were used. EFO currents and firing times ranged from 40 to 250mA and 0.11 to 0.90ms, respectively. Average FAB deformability factors, HAZ breaking forces, and HAZ lengths were in the rounded ranges of 36.64-44.09% (with a deformation force of 0.60N), 107.7-116.8mN, and 167-215@mm, respectively. When produced with 250mA current during 0.11ms, the FABs are 7.01-7.89% more deformable than when produced with 45mA during 0.9ms, the HAZ breaking force is 7.53-9.37% higher, and the HAZ length is 7-90@mm shorter.
Concept Theory in the Context of Information Systems
Authors: Jari Palomäki, Momir Radičević
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

In this paper the role and the proper place of a concept theory in the context of information systems is proposed. We define the basic modelling situation consisting of objects to be modelled, a modeller, i.e. a person who is modelling, a model, and the relationships between these. We continue this process by describing an information system. Having described information systems we consider a conceptual modelling process, the goal of which is to develop a conceptual schema of the domain of application. In this context the place of a concept theory is found as the foundation for all conceptual modelling.
A subcategorization acquisition system for French verbs
Authors: Cédric Messiant
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Student Research Workshop (2008)

This paper presents a system capable of automatically acquiring subcategorization frames (SCFs) for French verbs from the analysis of large corpora. We applied the system to a large newspaper corpus (consisting of 10 years of the French newspaper 'Le Monde') and acquired subcategorization information for 3267 verbs. The system learned 286 SCF types for these verbs. From the analysis of 25 representative verbs, we obtained 0.82 precision, 0.59 recall and 0.69 F-measure. These results are comparable with those reported in recent related work.
Dojo's industrial-strength grid widget
Authors: Matthew Russell
Venue: Linux Journal (2009)

Display arbitrarily large volumes of tabular data.
Modeling of fresh concrete flow
Authors: B. Patzák, Z. Bittnar
Venue: Computers and Structures (2009)

This paper focuses on the modeling of fresh concrete flow. Concrete that is not properly casted or consolidated may have defects, such as air voids, honeycombs, and aggregate segregation. The modeling of fresh concrete flow can significantly contribute to the durability and strength of a structure and it is necessary for design optimization of casting procedure. The fresh concrete is considered as a non-Newtonian fluid. The Bingham model is used as constitutive model, with the yield stress and plastic viscosity as parameters. An interface-capturing approach is used to track the position of a free surface.
Development of quantification algorithm for control valve stiction
Authors: H. Zabiri, A. Maulud, N. Omar, M. Ramasamy
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

Control valve stiction is the most commonly found valve problem in the process industry. Though many methods have been developed in detecting stiction, quantification of the actual amount of stiction presents in a loop is still an open research area. In this paper, Neural-network techniques are investigated in the development of a quantification algorithm for control valve stiction. It is shown that in the presence of a well-tuned controller, satisfactory performance of the proposed Neural-network based quantification algorithm can be achieved.
A group synchronization algorithm for VoIP conferencing
Authors: A. Dutta, R. Dasgupta, S. Bhattacharya
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Real Time audio conferencing in IP based packet network is one of the popular applications in these days. There are some serious synchronization problems in this technology, some of them are inter stream, intra stream and group synchronization. This paper deals with the problem of audio group synchronization in distributed multiparty group conferencing. When more than one participant in an audio conferencing session generates the audio packet at the same time, the mixed signal, when reaches to listener, becomes a non understandable noise. We propose an algorithm for the communication and synchronization of real time audio data in a distributed environment to overcome this group synchronization problem.
TFAN: A low complexity 3D mesh compression algorithm
Authors: Khaled Mamou, Titus Zaharia, Françoise Prêteux
Venue: Computer Animation and Virtual Worlds (2009)

This paper proposes a novel approach for mono-resolution 3D mesh compression, called TFAN (Triangle Fan-based compression). TFAN treats in a unified manner meshes of arbitrary topologies, i.e., manifold or not, oriented or not, while offering a linear computational complexity (with respect to the number of mesh vertices) for both encoding and decoding algorithms. In addition, the TFAN compressed representation is optimized for real-time decoding applications. In order to validate the proposed approach, two databases have been considered for experimentations. The first is the MPEG-4 test set, which includes over 3500 general purpose manifold meshes. The second, related to the French national project SEMANTIC-3D, includes over 4000 computer assisted design (CAD) meshes of highly irregular, non-manifold topologies. In both cases, the TFAN approach outperforms existing techniques such as MPEG-4-3DMC (3D Mesh Coding) or Touma and Gotsman, with decoding times lower by an order of magnitude at equivalent or even better levels of compression efficiency (&plusmn;10&percnt; in bitrate). In addition, when applied to non-manifold 3D data, the compression performances are significantly enhanced (6&ndash;30&percnt; gain in bitrate). Due to its high compression performances the TFAN approach has been recently retained for ISO standardization, within the framework of the MPEG-4-AFX standard. Copyright &copy; 2009 John Wiley & Sons, Ltd. The proposed TFAN (Triangle Fan-based) codec supports real-time encoding-decoding of 3D meshes with arbitrary topologies (i.e. manifold or not, oriented or not), by specifying ten topological configurations (cf. Figure 1). TFAN outperforms existing techniques such as MPEG-4-3DMC or Touma & Gotsman, with decoding times lower by an order of magnitude at equivalent or even better levels of compression efficiency. Due to its high performances, the TFAN approach has been recently retained for integration within the MPEG-4-AFX standard.
Learning of coordination: exploiting sparse interactions in multiagent systems
Authors: Francisco S. Melo, Manuela Veloso
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Creating coordinated multiagent policies in environments with uncertainty is a challenging problem, which can be greatly simplified if the coordination needs are known to be limited to specific parts of the state space, as previous work has successfully shown. In this work, we assume that such needs are unknown and we investigate coordination learning in multiagent settings. We contribute a reinforcement learning based algorithm in which independent decision-makers/agents learn both individual policies and when and how to coordinate. We focus on problems in which the interaction between the agents is sparse, exploiting this property to minimize the coupling of the learning processes for the different agents. We introduce a two-layer extension of Q-learning, in which we augment the action space of each agent with a coordination action that uses information from other agents to decide the correct action. Our results show that our agents learn both to act coordinate and to act independently, in the different regions of the space where they need to, and need not to, coordinate, respectively.
Clustering with Swarm Algorithms Compared to Emergent SOM
Authors: Lutz Herrmann, Alfred Ultsch
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

Swarm-based methods are promising nature-inspired techniques. A swarm of stochastic agents performs the task of clustering high-dimensional data on a low-dimensional output space. Most swarm methods are derivatives of the Ant Colony Clustering (ACC) approach proposed by Lumer and Faieta. Compared to clustering on Emergent Self-Organizing Maps (ESOM) these methods usually perform poorly in terms of topographic mapping and cluster formation. A unifying representation for ACC methods and Emergent Self-Organizing Maps is presented in this paper. ACC terms are related to corresponding mechanisms of the SOM. This leads to insights on both algorithms. ACC can be considered to be first-degree relatives of the ESOM. This explains benefits and shortcomings of ACC and ESOM. Furthermore, the proposed unification allows to judge whether modifications improve an algorithm's clustering abilities or not. This is demonstrated using a set of critical clustering problems.
Two-point heterogeneous connections in a continuum neural field model
Authors: C. A. Brackley, M. S. Turner
Venue: Biological Cybernetics (2009)

We examine a novel heterogeneous connection scheme in a 1D continuum neural field model. Multiple two-point connections are added to a local connection function in order to model the &#x201c;patchy&#x201d; connections seen in, for example visual cortex. We use a numerical approach to solve the equations, choosing the locations of the two-point connections stochastically. We observe self-sustained persistent fluctuations of activity which can be classified into two types (one of which is similar to that seen in network models of discrete excitable neurons, the other being particular to this model). We study the effect of parameters such as system size and the range, number and strength of connections, on the probability that a particular realisation of the connections is able to exhibit persistent fluctuations.
The Value of Component Commonality in a Dynamic Inventory System with Lead Times
Authors: Jing-Sheng Song, Yao Zhao
Venue: Manufacturing Service Operations Management (2009)

Component commonality has been widely recognized as a key factor in achieving product variety at low cost. Yet the theory on the value of component commonality is rather limited in the inventory literature. The existing results were built primarily on single-period models or periodic-review models with zero lead times. In this paper, we consider a continuous-review system with positive lead times. We find that although component commonality is in general beneficial, its value depends strongly on component costs, lead times, and dynamic allocation rules. Under certain conditions, several previous findings based on static models do not hold. In particular, component commonality does not always generate inventory benefits under certain commonly used allocation rules. We provide insight on when component commonality generates inventory benefits and when it may not. We further establish some asymptotic properties that connect component lead times and costs to the impact of component commonality. Through numerical studies, we demonstrate the value of commonality and its sensitivity to various system parameters in between the asymptotic limits. In addition, we show how to evaluate the system under a new allocation rule, a modified version of the standard first-in-first-out rule.
Clayworks: Toward User-Oriented Software for Collaborative Modeling and Simulation
Authors: Sergei Gorlatch, Jens Müller, Martin Alt, Jan Dünnweber, Hamido Fujita, Yutaka Funyu
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

We deal with the problem of developing a software system which integrates collaborative real-time modeling and distributed computing. The main challenge is user-orientation: we need a collaborative workspace for geographically dispersed users with a seamless access of every user to high-performance servers. Wedescribe a particular system, Clayworks, that allows modeling of virtual clay objects and running computation-intensive deformation simulations for objects crashing into each other. To integrate heterogeneous computational resources, we adopted modern Grid middleware and provided the users with an intuitive graphical interface. We parallelized the computation of simulations using a Higher-Order Component (HOC) which abstracts over the Globus Web service resource framework (WSRF) used to interconnect our worksuite to the computation server. Clayworks is a representative of a large class of demanding systems which combine collaborative, user-oriented modeling with performance-critical computations, e.g., crash-tests or simulations for biological population evolution.
Hybrid Adaptive Vision-Force Control for Robot Manipulators Interacting with Unknown Surfaces
Authors: Antonio C. Leite, Fernando Lizarralde, Liu Hsu
Venue: International Journal of Robotics Research (2009)

A hybrid control scheme based on adaptive visual servoing and direct force control is proposed for robot manipulators to perform interaction tasks on smooth surfaces. The camera parameters, as well as the constraint surface, are considered to be uncertain. A fixed camera with optical axis non-perpendicular to the robot workspace is used for position control, while a force sensor mounted on the robot wrist is used for force regulation. In order to solve the interaction problem on unknown surfaces, a method is developed to estimate the constraint geometry and keep the end-effector orthogonal to the surface at the contact point, during the task execution. Experimental results are presented to illustrate the performance and feasibility of the proposed scheme.
Incorporating Nucleosomes into Thermodynamic Models of Transcription Regulation
Authors: Tali Raveh-Sadka, Michal Levo, Eran Segal
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

Transcriptional control is central to many cellular processes and consequently, much effort has been devoted to understanding its underlying mechanisms. Recently, it has become evident that the organization of nucleosomes along promoter regions has an important role in transcriptional control, since most transcription factors cannot bind to sequences bound by nucleosomes, and thus compete with nucleosomes for DNA access. This competition is governed by the relative concentrations of nucleosomes and transcription factors and by their respective sequence binding preferences. Even though competition of nucleosomes and transcription factors may have significant effects on transcription, a mechanistic understanding of its quantitative consequences for gene expression is still missing. Here we employ a thermodynamic framework based on fundamental principles of statistical mechanics to theoretically explore the effect that different nucleosome organizations along promoters have on the activation dynamics of promoters in response to varying concentrations of the regulating transcription factors. We show that even simple landscapes of nucleosome organization reproduce experimental results regarding the effect of nucleosomes as general repressors and as generators of obligate binding cooperativity between transcription factors. Our modeling framework also allows us to characterize the effects that various sequence elements of promoters will have on the induction threshold and on the shape of the promoter activation curves.
Tracing the Parallel Paths of Knowledge Management in the Organizational Domain and the Autonomic Paradigm
Authors: Costas Polychronopoulos, Makis Stamatelatos, Nancy Alonistioti
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Knowledge is a key focus area in the emerging autonomic paradigm. The cognitive control loop inside an autonomic element revolves around the knowledge base built within the element. But the concept sounds familiar. For years now, knowledge epistemology and, in specific, the knowledge management domain have been focusing on the knowledge acquisition, dissemination and sharing mechanisms inside the big picture of knowledge-intensive organizations. This paper argues that the two domains bear significant resemblances and attempts to pinpoint them by forming the necessary analogies.
The Netflix prize, computer science outreach, and Japanese mobile phones
Authors: Greg Linden, Michael Conover, Judy Robertson
Venue: Communications of the ACM (2009)

The Communications Web site, http://cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish excerpts from selected posts.Greg Linden writes about machine learning and the Netflix Prize, Judy Robertson offers suggestions about getting teenagers interested in computer science, and Michael Conover discusses mobile phone usage and quick response codes in Japan.
Complete catalogue of graphs of maximum degree 3 and defect at most 4
Authors: Mirka Miller, Guillermo Pineda-Villavicencio
Venue: Discrete Applied Mathematics (2009)

We consider graphs of maximum degree 3, diameter D>=2 and at most 4 vertices less than the Moore bound M"3","D, that is, (3,D,-@e)-graphs for @e@?4. We prove the non-existence of (3,D,-4)-graphs for D>=5, completing in this way the catalogue of (3,D,-@e)-graphs with D>=2 and @e@?4. Our results also give an improvement to the upper bound on the largest possible number N"3","D of vertices in a graph of maximum degree 3 and diameter D, so that N"3","D@?M"3","D-6 for D>=5.
Optimization in logical analysis of data
Authors: Peter L. Hammer, Alexander Kogan
Venue:  (2007)

Logical Analysis of Data (LAD) is a machine learning/data mining methodology that combines ideas from areas such as Boolean functions, optimization and logic. In this thesis, we focus on the description and the application of novel optimization models to the construction of improved and/or simplified LAD models of data. We address the construction of LAD classification models, proposing two alternative ways of generating patterns, or rules. First, we show how to construct LAD models based on patterns of maximum coverage. We show, through a series of computational experiments, that such models are as good as, if not better than those obtained with the standard LAD implementation and other machine learning methods, while requiring a much simpler calibration for optimal performance. We formulate the problem of finding the most suitable LAD model as a large linear program, and show how to solve it using column generation. For the subproblem phase, we describe a branch-and-bound algorithm, whose performance is significantly superior to that of a commercial integer programming solver. The LAD models produced by this algorithm are virtually parameter-free and practically as accurate as the calibrated models obtained with other machine learning methods. Finally, we propose a novel regression algorithm that extends the LAD methodology for the case of a numerical outcome and show that it constitutes an attractive alternative to other regression methods in terms of performance and flexibility of use.