ppxscal/embedding_network huggingface dataset:
Hardware-Based Solutions Utilizing Random Forests for Object Recognition
Authors: Hassab Elgawi Osman
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper presents how hardware-based machine learning models can be designed for the task of object recognition. The process is composed of automatic representation of objects as covariance matrices follow by a machine learning detector based on random forest (RF) that operate in on-line mode. We describe the architecture of our random forest (RF) classifier employing Logarithmic Number Systems (LNS), which is optimized towards a System-on-Chip (Soc) platform implementation. Results demonstrate that the proposed model yields in object recognition performance comparable to the benchmark standard RF, AdaBoost, and SVM classifiers, while allow fair comparisons between the precision requirements in LNS and of using traditional floating-point. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Use of Social Network Analysis in Knowledge Diffusion Research from Patent Data
Authors: Chao-Chih Hsueh, Chun-Chieh Wang
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Patent documents are an ample source of technical and commercial knowledge and, thus, patent analysis has long been considered a useful vehicle for R&D management and technoeconomic analysis. In terms of techniques for patent analysis, citation analysis has been the most frequently adopted tool. In this research, we note that citation analysis is subject to some crucial drawbacks and propose a network-based analysis, an alternative method for citation analysis. By using an illustrative data set, the overall process of developing patent network is described. The main objective is to understand that the knowledge diffuse between institution and countries. The knowledge diffusion networks are described by using critical node, core network, and network measures analysis .This includes identifying key influential players, the knowledge spillover patterns among them, and the overall knowledge spillover efficiency. The proposed framework is applied to the field of liquid crystal display (LCD), including the patent citation networks of assignee and countries. The analysis shows that the Japan is the most important citation center in LCD research and the LG Phillps LCD, Sharp Samsung, Hitachi, IBM, and AUO are central points of knowledge flow.
Query Automata for Nested Words
Authors: P. Madhusudan, Mahesh Viswanathan
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We study visibly pushdown automata (VPA) models for expressing and evaluating queries on words with a nesting structure. We define a query VPA model, which is a 2-way deterministic VPA that can mark in one run all positions in a document that satisfy a query, and show that it is equi-expressive as unary monadic queries. This surprising result parallels a classic result by Hopcroft and Ullman for queries on regular word languages. We also compare our model to query models on unranked trees, and show that our result is fundamentally different from those known for automata on trees.
A Method of Research on the Multi-level JMX Network Management
Authors: Wang HaiTao, Chang ChunQin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In view of questions of management node duty is heavy and link load bearing increases and so on, which traditional network centralized management appears. This article analyses the centralized management model based on the simple network management protocols(SNMP) and researches the Java Management eXtensions(JMX) hierarchical structure based on the Java technology. According theory of distributed system and designing project, the author presents the multi-level JMX network management system framework applied to network management. The article details the part of realization of the key side, can guide the designing and realization.
A Three-Tier Profiling Framework for Adaptive e-Learning
Authors: Frederick W. Li, Rynson W. Lau, Parthiban Dharmendran
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

Existing methods support adaptive e-learning mainly by setting student characteristics in a student profile, and use it as a filter to extract suitable learning content from a dedicated structure of course materials. If simple student characteristics, such as prior knowledge and learning preference, are considered, it may be straightforward for an instructor to set up the student profiles. However, if complicated student characteristics, such as learning styles, interaction styles and content styles, and other factors that affect the students' interests on the course materials are involved, it may become too difficult for an instructor to design a suitable course structure matching all these criteria. It is also complicated for system implementation as many rules need to be set up. In this paper, we propose a three-tier profiling framework in conjunction with a concept space structure and a set of concept filters to address the above problems. The framework offers a unified way to model and handle a variety of student learning needs and the different factors that affect course material relevance. The framework is extensible in nature and can form the foundation for the future development of adaptive e-learning systems.
An iterative design procedure for the synthesis of generalized dual-bandpass filters
Authors: Dominic Deslandes, François Boone
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

This article presents an iterative design technique to calculate the optimal position of transmission zeros in dual-bandpass filters. In the proposed design technique, the characteristic function of the filter is linearized around the displacement of the transmission zeros. A linear system is then obtained and solved in combination with a damping technique used to guarantee the convergence. Design examples which demonstrate the efficiency of the proposed method are presented and an experimental verification at 4 GHz using open-loop resonators validates the methodology. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
An Improved Particle Swarm Optimization for the Constrained Portfolio Selection Problem
Authors: Jianwei Gao, Zhonghua Chu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

We focus on a constrained portfolio selection model with transaction costs and quantity limit. Due to these complex constraints, the process becomes a high-dimensional constrained optimization problem. Traditional optimization algorithms fail to work efficiently and heuristic algorithms with effective searching ability can be the best choose for the problem, and then we design an improved particle swarm (ISPO) optimization to solve this question. In order to prevent premature convergence to local minima, we design a new definition for global point. Finally, a numerical example of a portfolio selection problem is given to illustrate our proposed method; the simulation results demonstrate good performance of the IPSO in solving the complex constrained portfolio selection problem.
The Communication Complexity of Non-signaling Distributions
Authors: Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared quantum states, and XOR games. In this model, Alice gets an input x, Bob gets an input y, and their goal is to each produce an output a,b distributed according to some pre-specified joint distribution p(a,b|x,y). Our results apply to any non-signaling distribution, that is, those where Alice's marginal distribution does not depend on Bob's input, and vice versa.By introducing a simple new technique based on affine combinations of lower-complexity distributions, we give the first general technique to apply to all these settings, with elementary proofs and very intuitive interpretations. The lower bounds we obtain can be expressed as linear programs (or SDPs for quantum communication). We show that the dual formulations have a striking interpretation, since they coincide with maximum violations of Bell and Tsirelson inequalities. The dual expressions are closely related to the winning probability of XOR games. Despite their apparent simplicity, these lower bounds subsume many known communication complexity lower bound methods, most notably the recent lower bounds of Linial and Shraibman for the special case of Boolean functions.We show that as in the case of Boolean functions, the gap between the quantum and classical lower bounds is at most linear in the size of the support of the distribution, and does not depend on the size of the inputs. This translates into a bound on the gap between maximal Bell and Tsirelson inequality violations, which was previously known only for the case of distributions with Boolean outcomes and uniform marginals. It also allows us to show that for some distributions, information theoretic methods are necessary to prove strong lower bounds.Finally, we give an exponential upper bound on quantum and classical communication complexity in the simultaneous messages model, for any non-signaling distribution.
A (very) brief introduction to fluid construction grammar
Authors: Luc Steels, Joachim de Beule
Venue: Proceedings of the Third Workshop on Scalable Natural Language Understanding (2006)

Fluid Construction Grammar (FCG) is a new linguistic formalism designed to explore in how far a construction grammar approach can be used for handling open-ended grounded dialogue, i.e. dialogue between or with autonomous embodied agents about the world as experienced through their sensory-motor apparatus. We seek scalable, open-ended language systems by giving agents both the ability to use existing conventions or ontologies, and to invent or learn new ones as the needs arise. This paper contains a brief introduction to the key ideas behind FCG and its current status.
RESDEM, a tool for integrating temporal remote sensing data for use in hydrogeologic investigations
Authors: Adam Milewski, Mohamed Sultan, Swaroop Markondiah Jayaprakash, Rajesh Balekai, Richard Becker
Venue: Computers Geosciences (2009)

The dramatic increase in space-borne sensors over the past two decades is presenting unique opportunities for new and enhanced applications in various scientific disciplines. Using these data sets, hydrogeologists can now address and understand the partitioning of water systems on regional and global scales, yet such applications present mounting challenges in data retrieval, assimilation, and analysis for scientists attempting to process relevant large temporal remote sensing data sets (e.g., TRMM, SSM/I, AVHRR, MODIS, QuikSCAT, and AMSR-E). We describe solutions to these problems through the development of an interactive data language (IDL)-based computer program, the remote sensing data extraction model (RESDEM) for integrated processing and analysis of a suite of remote sensing data sets. RESDEM imports, calibrates, and georeferences scenes, and subsets global data sets for the purpose of extracting and verifying precipitation over areas and time periods of interest. Verification of precipitation events is accomplished by integrating other long-term satellite based data sets. The modules in RESDEM process data for cloud detection and others for detecting changes in soil moisture, vegetative water capacity and vegetation intensity following targeted precipitation events. Using the arid Sinai Peninsula (SP; area: 61,000km^2) and the Eastern Desert (ED; area: 220,000km^2) of Egypt as test sites, we demonstrate how RESDEM outputs (verified precipitation events) are now enabling regional scale applications of continuous (1998-2006) rainfall-runoff and groundwater recharge computations.
A Hybrid Music Recommendation System by M-LSA
Authors: Bin Hu, Meng Guo, Hongbin Zhang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In this paper, a hybrid music recommendation system is proposed, which combines collaborative filtering and content-base recommendation. Neither of these two parts can make full use of all the information. Our method integrates both user rating and music content information using an expansion method of LSA (Latent Semantic Analysis) called M-LSA. We use a text representation for music content information, which is obtained by K-means Clustering or HMM method. Experiments on the data of 300 popular songs show that the proposed approach achieves satisfactory results.
How Risky Is the Random-Oracle Model?
Authors: Gaëtan Leurent, Phong Q. Nguyen
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instantiations proposed in the literature for such cases are weaker than a random oracle, including the proposals by Bellare and Rogaway from 1993 and 1996, and the ones implicit in IEEE P1363 and PKCS standards: for instance, we obtain a 267 preimage attack on BR93 for 1024-bit digests. Next, we study the security impact of hash function defects for ROM signatures. As an extreme case, we note that any hash collision would suffice to disclose the master key in the ID-based cryptosystem by Boneh et al. from FOCS '07, and the secret key in the Rabin-Williams signature for which Bernstein proved tight security at EUROCRYPT '08. Interestingly, for both of these schemes, a slight modification can prevent these attacks, while preserving the ROM security result. We give evidence that in the case of RSA and Rabin/Rabin-Williams, an appropriate PSS padding is more robust than all other paddings known.
Design of Remote Supervisory System of Large-scale Oil Tanks Based on ASP
Authors: Lin Hongju, Liu Rongchang, Wang Qingzhu, Ma Jiwei, Liu Jinhua
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

At present, many large-scale oil tanks of petrochemical tank farms are operated by manual power or adopted by C/S (Client/Server) access mode, one new remote online supervising system based on ASP was presented. The CAN Bus was core of bottom layer control network, and design of CAN Bus intellect node is given. Web server was built by ASP and DDE (Dynamic Data Exchange) based on B/S (Browser/Server) access mode. Debugging results and Web released method were given. Seamless connection has been realized between control network and Internet/Intranet. Authorized users can supervise oil tanks parameters by general IE browser on off-site. The system application prospects are widespread in petroleum and chemical industry.
An Efficient Algorithm for Computing Multi-scale Connectivity Measures
Authors: Georgios K. Ouzounis
Venue: Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing (2009)

Multi-scale connectivity measures have been introduced in the context of shape analysis and image segmentation. They are computed by progressive shape decomposition of binary images. This paper presents an efficient method to compute them based on the dual-input Max-Tree algorithm. Instead of handling a stack of binary images, one for each scale, the new method reads a single gray-level image, with each level associated to a unique scale. This reduces the component labeling iterations from a total number equal to the number of scales to just a single pass of the image. Moreover, it prevents the repetitive decomposition of each component under study, for the remaining scale range, since these information are already mapped from the input image to the tree hierarchy. Synthetic and real image examples are given and performance issues are discussed.
An Indoor Crowd Simulation Using a 2D-3D Hybrid Data Model
Authors: Chulmin Jun, Hyeyoung Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Recent LBS-related technologies tend to extend to indoor spaces using localization sensors such as RFID. In order to implement real time evacuation applications, at least two problems must be resolved in advance; first, proper indoor data models and implementation methods that can accommodate evacuees positioning and routing computations should be available, second, evacuation simulations also need to be performed using the same indoor databases for consistent integration. However, none of these have been suggested explicitly as of now. Although some 3D modeling studies have dealt with topological structures, they are mainly focused on outer building volumes and it is difficult to incorporate such theoretical topology into indoor spaces due to complexity and computational limitations. In this study, we suggest an alternative method to build a 3D indoor model with less cost. It is a 2D-3D hybrid data model that combines the 2D topology constructed from CAD floor plans and the 3D visualization functionality. We show the process to build the proposed model in a spatial DBMS and visualize in 2D and 3D. Also, we illustrate a test CA(cellular automata)-based 3D crowd simulation using our model.
Maximum Independent Set of Links under Physical Interference Model
Authors: Peng-Jun Wan, Xiaohua Jia, Frances Yao
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose senders transmit at a fixed uniform power level, select a maximum set of independent links. This problem is known to be NP-hard. The existing approximation algorithms which were claimed to have constant approximation bounds are either valid only in the absence of background noise or simply incorrect in the presence of background noise. In this paper, we develop a new approximation algorithm with constant approximation bound regardless of the value of the background noise. In addition, our approximation bound valid in general is significantly smaller than all the known bounds which are only valid under certain special assumptions.
Information integration with uncertainty
Authors: Ala A. Eshmawi, Fereidoon Sadri
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

The two problems of information integration and interoperability among multiple sources, and management of uncertain data have received significant attention in recent years. In this paper we study information integration and interoperability among XML sources with uncertain data. We extend query processing algorithms in the semantic-model approach for information integration and interoperability to the case where sources may contain uncertain XML information, and present probability-calculation algorithms for answers to a user query in this approach.
Interchange rearrangement: The element-cost model
Authors: Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
Venue: Theoretical Computer Science (2009)

Given an input string S and a target string T when S is a permutation of T, the interchange rearrangement problem is to apply on S a sequence of interchanges, such that S is transformed into T. The interchange operation exchanges the position of the two elements on which it is applied. The goal is to transform S into T at the minimum cost possible, referred to as the distance between S and T. The distance can be defined by several cost models that determine the cost of every operation. There are two known models: The Unit-cost model and the Length-cost model. In this paper, we suggest a natural cost model: The Element-cost model. In this model, the cost of an operation is determined by the elements that participate in it. Though this model has been studied in other fields, it has never been considered in the context of rearrangement problems. We consider both the special case where all elements in S and T are distinct, referred to as a permutation string, and the general case, referred to as a general string. An efficient optimal algorithm for the permutation string case and efficient approximation algorithms for the general string case, which is NP-hard, are presented. The study is broadened to include the transposition rearrangement problem under the Element-cost model and under the other known models, in order to provide additional perspective on the new model.
Activity patterns in networks stabilized by background oscillations
Authors: Frank Hoppensteadt
Venue: Biological Cybernetics (2009)

The brain operates in a highly oscillatory environment. We investigate here how such an oscillating background can create stable organized behavior in an array of neuro-oscillators that is not observable in the absence of oscillation, much like oscillating the support point of an inverted pendulum can stabilize its up position, which is unstable without the oscillation. We test this idea in an array of electronic circuits coming from neuroengineering: we show how the frequencies of the background oscillation create a partition of the state space into distinct basins of attraction. Thus, background signals can stabilize persistent activity that is otherwise not observable. This suggests that an image, represented as a stable firing pattern which is triggered by a voltage pulse and is sustained in synchrony or resonance with the background oscillation, can persist as a stable behavior long after the initial stimulus is removed. The background oscillations provide energy for organized behavior in the array, and these behaviors are categorized by the basins of attraction determined by the oscillation frequencies.
Quality-based supplier selection and evaluation using fuzzy data
Authors: Ming-Hung Shu, Hsien-Chung Wu
Venue: Computers and Industrial Engineering (2009)

Since fuzzy quality data are ubiquitous in the real world, under this fuzzy environment, the supplier selection and evaluation on the basis of the quality criterion is proposed in this paper. The C"p"k index has been the most popular one used to evaluate the quality of supplier's products. Using fuzzy data collected from q>=2 possible suppliers' products, fuzzy estimates of q suppliers' capability indices C"p"k"i(i=1,2,...,q) are obtained according to the form of resolution identity that is a well-known theorem in fuzzy sets theory. Certain optimization problems are formulated and solved to obtain @a-level sets for the purpose of constructing the membership functions of fuzzy estimates of C"p"k"i. These membership functions are sorted by using a fuzzy ranking method to choose the preferable suppliers. Finally, a numerical example is illustrated to present the possible application by incorporating fuzzy data into the quality-based supplier selection and evaluation.