ppxscal/embedding_network huggingface dataset:
A vision-oriented approach for innovative product design
Authors: Chyun-Chau Lin, Ding-Bang Luh
Venue: Advanced Engineering Informatics (2009)

Nowadays, business globalization, complex consumer requirements, and high technology development have led to vigorous business competition and market uncertainty. In new product design, it is increasingly important to put more emphasis on innovative concerns than quality and speed of production. Providing unique, innovative and value-added products becomes a crucial strategy for success. This study aims to develop a new product design process that concentrates on radical innovations. Visioning thinking, TRIZ, Image Scale, and Morphological Analysis are integrated for developing designs with a balance of rational/logical analyses and intuitive/creative thinking. The proposed process fulfills the need for radical innovation through enriching heuristic thinking. It is a useful methodology that adds value to products in terms of technological functions, form perceptions, and holistic usability. A proposal of therapy bike design for cerebral palsy children is demonstrated using the new process. Through case demonstration, designers could enhance products with human-centered values while coping with market uncertainty effectively. The applicability of the vision-oriented approach for innovative product design is verified.
The Development and Application of Decision Tree for Agriculture Data
Authors: Jun Wu, Anastasiya Olesnikova, Chi-Hwa Song, Won Don Lee
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

With the rapid increase of the world’s population, the drastic changes in world’s food supply, and the limitation of land resources, the pressure for agriculture is greater than ever before. With the development of AI theories and technologies, the study in the classification of agriculture data becomes more advanced and intellectualized. This paper mainly discusses a specific decision tree classifier which is used to predict and classify agriculture data. It is capable of dealing with both complete data and incomplete data. So that it can be applied into the classification problem for all kinds of agriculture data sets. The experiments are designed to prove the advantage of the proposed algorithm.
Current State olf the Art, Challenges and Future Directions for Audio Watermarking
Authors: Mitchell D. Swanson, Bin Zhu, Ahmed H. Tewfik
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Transparent data embedding algorithms embed binary streams in host multimedia signals. The embedded data is perceptually inaudible to maintain the quality of the source data. The embedded data can add features to the host multimedia signal or provide copyright protection. We review developments and requirements in transparent data embedding techniques for audio signals. We describe our latest audio embedding algorithm and include experimental results indicating robustness to low bit rate MPEG-Layer 3, AAC, and Dolby AC-3 coding. We conclude with a discussion offuture research directions.
Random walks for selected boolean implication and equivalence problems
Authors: K. Subramani, Hong-Jian Lai, Xiaofeng Gu
Venue: Acta Informatica (2009)

This paper is concerned with the design and analysis of a random walk algorithm for the 2CNF implication problem (2CNFI). In 2CNFI, we are given two 2CNF formulas $${\phi_{1}}$$and $${\phi_{2}}$$and the goal is to determine whether every assignment that satisfies $${\phi_{1}}$$, also satisfies $${\phi_{2}}$$. The implication problem is clearly coNP-complete for instances of kCNF, k &#x2265; 3; however, it can be solved in polynomial time, when k &#x2264; 2. The goal of this paper is to provide a Monte Carlo algorithm for 2CNFI with a bounded probability of error. The technique developed for 2CNFI is then extended to derive a randomized, polynomial time algorithm for the problem of checking whether a given 2CNF formula Nae-implies another 2CNF formula.
A Comparison of Metric-Based and Empirical Approaches for Cognitive Analysis of Modeling Languages
Authors: Ali Kamandi, Jafar Habibi
Venue: Fundamenta Informaticae (2009)

Modeling languages are needed to describe the conceptual construct underlying software. Several modeling languages have been proposed during the last decades. Cognitive complexity is one of the common problems in designing modeling languages. Users have to split their attention and cognitive resources between two different tasks when working with complex language: solving the problem and understanding the elements composing the language. Several researches have been accomplished to evaluate cognitive complexity of modeling languages, among them, metric based and empirical approaches aremore important and convenient than others. In this paper, we compared these two methods. Results show that there is no significant relation between outputs generated by these approaches.
A data base management problem specification model
Authors: Gerard T. Capraro, P. Bruce Berra
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The data base management systems (DBMS) area has been growing at an accelerating pace over the past few years. There have been and are DBMS studies being conducted at many different government, industrial and university establishments. The work however, is primarily concerned with the software and hardware problems of building DBMS with unique capabilities. However, large scale research is not being conducted in the area of determining the interface between the DBMS and the data base problems they were created to solve. Each data base problem is as unique as the users of DBMS.
An empirical analysis of return on investment maximization in sponsored search auctions
Authors: Jason Auerbach, Joel Galenson, Mukund Sundararajan
Venue: Proceedings of the 2nd International Workshop on Data Mining and Audience Intelligence for Advertising (2008)

We empirically investigate whether advertisers are maximizing their return on investment (ROI) across multiple keywords in sponsored search auctions. Because testing for ROI maximization relies on knowledge of advertisers' private true values per click, we instead use necessary (although not sufficient) conditions for ROI maximizing behavior that rely only on advertisers' bids. We classify advertisers based on the extent to which they satisfy the test conditions. Our results indicate that a large fraction of advertisers in the Yahoo Webscope first price data set may be following ROI-based strategies.
Semantic Video Model for Content-Based Retrieval
Authors: Jia-Ling Koh, Chin-Sung Lee, Arbee L. P. Chen
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Traditional research on video data retrieval follows two general approaches. One is based on text annotation and the other on content-based comparison. However, these approaches do not fully make use of the meaning implied in a video stream. To improve these approaches, a semantic video model cooperated with a knowledge database is studied. In this paper, we propose a new semantic video model and focus on presenting the semantic meaning implied in a video. According to the granularity of the meaning implied in a video, a five-level layered structure to model a video stream is proposed. A mechanism is also provided to construct the five levels based on the knowledge categories defined in the knowledge database. The five-level layered structure consists of raw-data levels and semantic-data levels. A uniform semantics representation is proposed to represent the semantic-data levels. This uniform semantics representation allows measuring the similarity of two video streams with different duration. Then an interactive interface can provide browsing and querying video data efficiently through the uniform semantics representation.
Using audio in secure device pairing
Authors: Michael T. Goodrich, Michael Sirivianos, John Solis, Claudio Soriente, Gene Tsudik, Ersin Uzun
Venue: International Journal of Security and Networks (2009)

Secure pairing of electronic devices is an important issue that must be addressed in many contexts. In the absence of prior security context, the need to involve the user in the pairing process is a prominent challenge. In this paper, we investigate the use of the audio channel for human-assisted device pairing. First we assume a common (insecure) wireless channel between devices. We then obviate the assumption of a pre-existing common channel with a single-channel device pairing approach only based on audio. Both approaches are applicable to a wide range of devices and place light burden on the user.
A comparison of methods for assessing penetrating trauma on retrospective multi-center data
Authors: Bilal A. Ahmed, Michael E. Matheny, Phillip L. Rice, John R. Clarke, Omolola I. Ogunyemi
Venue: Journal of Biomedical Informatics (2009)

Objective: TraumaSCAN-Web (TSW) is a computerized decision support system for assessing chest and abdominal penetrating trauma which utilizes 3D geometric reasoning and a Bayesian network with subjective probabilities obtained from an expert. The goal of the present study is to determine whether a trauma risk prediction approach using a Bayesian network with a predefined structure and probabilities learned from penetrating trauma data is comparable in diagnostic accuracy to TSW. Methods: Parameters for two Bayesian networks with expert-defined structures were learned from 637 gunshot and stab wound cases from three hospitals, and diagnostic accuracy was assessed using 10-fold cross-validation. The first network included information on external wound locations, while the second network did not. Diagnostic accuracy of learned networks was compared to that of TSW on 194 previously evaluated cases. Results: For 23 of the 24 conditions modeled by TraumaSCAN-Web, 16 conditions had Areas Under the ROC Curve (AUCs) greater than 0.90 while 21 conditions had AUCs greater than 0.75 for the first network. For the second network, 16 and 20 conditions had AUCs greater than 0.90 and 0.75, respectively. AUC results for learned networks on 194 previously evaluated cases were better than or equal to AUC results for TSW for all diagnoses evaluated except diaphragm and heart injuries. Conclusions: For 23 of the 24 penetrating trauma conditions studied, a trauma diagnosis approach using Bayesian networks with predefined structure and probabilities learned from penetrating trauma data was better than or equal in diagnostic accuracy to TSW. In many cases, information on wound location in the first network did not significantly add to predictive accuracy. The study suggests that a decision support approach that uses parameter-learned Bayesian networks may be sufficient for assessing some penetrating trauma conditions.
Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey
Authors: Mitsuo Gen, Lin Lin, Haipeng Zhang
Venue: Computers and Industrial Engineering (2009)

Integrated manufacturing system (IMS) is a novel manufacturing environment which has been developed for the next generation of manufacturing and processing technologies. It consists of engineering design, process planning, manufacturing, quality management, and storage and retrieval functions. Improving the decision quality in those fields give rise to complex combinatorial optimization problems, unfortunately, most of them fall into the class of NP-hard problems. Find a satisfactory solution in an acceptable time play important roles. Evolutionary techniques (ET) have turned out to be potent methods to solve such kind of optimization problems. How to adapt evolutionary technique to the IMS is very challenging but frustrating. Many efforts have been made in order to give an efficient implementation of ET to optimize the specific problems in IMS. In this paper, we address four crucial issues in IMS, including design, planning, manufacturing, and distribution. Furthermore, some hot topics in these issues are selected to demonstrate the efficiency of ET's application, such as layout design (LD) problem, flexible job-shop scheduling problem (fJSP), multistage process planning (MPP) problem, and advanced planning and scheduling (APS) problem. First, we formulate a generalized mathematic models for all those problems; several evolutionary algorithms which adapt to the problems have been proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of our proposed approach.
Customising Web Information Systems According to User Preferences
Authors: Klaus-Dieter Schewe, Bernhard Thalheim, Qing Wang
Venue: World Wide Web (2009)

Web Information Systems have to serve a variety of users with very diverse preferences regarding content, functionality and presentation. We first investigate the customisation of functionality at a high-level of abstraction, where possible action sequences are represented by an algebraic expression called plot, and user preferences give rise to equations. We show that the problem can be solved by applying conditional term rewriting on the basis of Kleene algebras with tests. By exploiting the idea of weakest preconditions such expressions can be represented by formal power series with coefficients in a Boolean algebra. This gives rise to a sufficient condition for termination based on well-founded orders on such power series. As confluence cannot be guaranteed, we propose critical pair completion to be used in order to enforce the desirable Church-Rosser property. In a second step we parametrise the actions and replace the Boolean conditions by first-order formulae. We show that still term rewriting can be applied, but termination and Church Rosser property become problems that will require manual interaction, in particular, as preference rules will make use of the parameters. On the other hand the presence of first-order conditions can be used to extend the customisation to the content.
Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
Authors: Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul Sung, Seokhie Hong, Jongin Lim, Haeryong Park, Kilsoo Chun
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a (t + 1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from the perspective of collision resistance are O(t2q/2tn + q2/2(t + 1)n). In the case of t = 1, the advantage is near-optimal. In the case of t > 1, the advantage is optimal.
Graph representation functions computable by finite automata
Authors: Vadim V. Lozin
Venue: Journal of Automata, Languages and Combinatorics (2008)

We consider a simple model for representing a graph in computer memory in which every vertex is assigned a word in a finite alphabet - vertex code - and the adjacency of two vertices is a function Ψ of their codes. The function Ψ is called the representation function. We say that Ψ is universal if a Ψ-representation exists for every simple graph G. In this paper, we study representation functions computable by automata with two states. The main result is a criterion characterizing the universal functions. In the case of binary alphabet, we provide some bounds on the dimension of minimum Ψ-representation.
Microstructure analysis in strained-InGaN/GaN multiple quantum wells
Authors: Huaping Lei, Jun Chen, Xunya Jiang, Gérard Nouet
Venue: Microelectronics Journal (2009)

The barrier thickness effect on the energy and microstructure properties of InGaN/GaN multiple quantum wells is investigated with Stillinger-Weber potential. The calculation indicates that the energy of a quantum well increases as the GaN barrier thickness rises, and that Ga-N and In-N bonds are shrunk with respect to those of random InGaN alloy. Moreover, a critical value of the barrier thickness exits. If the barrier thickness exceeds the critical value, the bond length of Ga-N in quantum wells reduces as a function of indium concentration. This singular behavior of Ga-N bond is analyzed with a force balance model.
Slip On
Authors: GROOVISIONS
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Since 2005, GROOVISIONS has produced five music videos for the Japanese artist Halfby. This is the latest in the series.
Termination Analysis of CHR Revisited
Authors: Paolo Pilozzi, Danny Schreye
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Today, two distinct direct approaches to prove termination of CHR programs exist. The first approach, by T. Frühwirth, proves termination of CHR programs without propagation. The second, by Voets et al., deals with programs that contain propagation. It is however less powerful on programs without propagation. In this paper, we present new termination conditions that are strictly more powerful than those from previous approaches and that are also applicable to a new class of programs. Furthermore, we present a new representation for CHR states for which size-decreases between consecutive states correspond to termination. Both contributions are linked: our termination conditions correspond to the existence of a well-founded order on the new state representation, which decreases for consecutive computation states.
Multivariate generalized S-estimators
Authors: E. Roelant, S. Van Aelst, C. Croux
Venue: Journal of Multivariate Analysis (2009)

In this paper we introduce generalized S-estimators for the multivariate regression model. This class of estimators combines high robustness and high efficiency. They are defined by minimizing the determinant of a robust estimator of the scatter matrix of differences of residuals. In the special case of a multivariate location model, the generalized S-estimator has the important independence property, and can be used for high breakdown estimation in independent component analysis. Robustness properties of the estimators are investigated by deriving their breakdown point and the influence function. We also study the efficiency of the estimators, both asymptotically and at finite samples. To obtain inference for the regression parameters, we discuss the fast and robust bootstrap for multivariate generalized S-estimators. The method is illustrated on a real data example.
Accelerated design of analog, mixed-signal circuits in Titan
Authors: Anirudh Devgan, Bulent Basaran, David Colleran, Mar Hershenson
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Analog circuits are designed in fundamentally different ways than their counterparts in the digital domain. However, two major trends have made analog and digital circuits mix and co-exist. First, high-performance analog circuits use digital parts and vice versa. Second, the desire for new features, ease of use and reducing integration costs brings together more digital, analog and RF circuits in one die. This convergence of circuits creates a significant need for analog and digital layout tools to also unify. The first such solution the EDA industry provides is Magma's Titan design platform [1]. In this extended abstract, we describe how Titan speeds up mixed signal circuit and layout design with new capabilities and a new level of integration of tools
A web usage mining algorithm for web personalization
Authors: Antonio Picariello, Carlo Sansone
Venue: Intelligent Decision Technologies (2008)

The explosive growth of the web is at the basis of the great interest into web usage mining techniques in both the commercial and academic communities. This paper presents a classification algorithm for web personalization based on web usage mining techniques. The algorithm takes into account both static information, by means of classical clustering techniques, and dynamic user behavior, thus proposing a novel and effective re-classification algorithm. Experiments have been carried out in order to validate our approach and evaluate the proposed algorithm.
The CODASYL and GUIDE/SHARE proposals on data base management systems
Authors: Larry Simonette, Barbara Fossum, Chuck Mairet, C. W. Bachman Mike O'Connell, Roger Holliday, Don Jardine
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Six panelists will discuss the subject of Data Base Management (DBM) as it relates to CODASYL's Data Base Language Task Group report and Data Definition Language Committee Report and the GUIDE/SHARE published requirements for a DBM and other published GUIDE documents deemed pertinent. Four key issues that best deal with the philosophy, concepts and differences of the CODASYL and GUIDE/SHARE work to date will be addressed.
Evolved Look-Up Tables for Simulated DNA Controlled Robots
Authors: Gary Greenfield
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

We describe our efforts to convert (short) DNA sequences obtained from the NCBI library into control sequences for simulated robots by simultaneously evolving both a look up table to assign codons to robot commands and a look up table to assign codons to numerical values that serve as arguments to those commands. Our simulated robot is loosely modeled after the Khepera robot. When the robot's sensing capabilities are disabled, we are provided with a sophisticated turtle graphics platform. We formulate a fitness function for evaluating the drawings obtained from codon look up tables and we make inter-DNA and intra-DNA comparisons using our evolved tables. Our results suggest that information content can only be weakly extracted from DNA in this way. 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
Design and Integration of a Modular Platform for Indoor Mobile Robots
Authors: Zhang Zhen, Cao Qixin, Charles Lo
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper presents a CORBA based modular mobile robot platform which allows for programming and control of indoor mobile robots. The system provides functions such as building of the robot’s model, path planning, robot task planning, simulation and actual robot control functions in an indoor environment. Users can program virtual robots in a customized simulation environment, and check the performance of execution. This framework has been applied to Yaskawa’s dual-arm-mobile service robot, “SmartPal”. The simulation results show that our robotic framework can simulate and control the mobile robot to perform various complex tasks.
Research on the relationship of tie modality of interfirm network and technological innovation
Authors: Xinmin Peng
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

The paper employs a case to explore and explain the relative propositions of tie modality of interfirm network and different technological innovation. The impact of different network tie strengths on exploratory and exploitative innovation success is analyed in detail. A key point is that strong ties are valuable in environments that require exploitation, while weak ties would be more appropriate for exploration. Therefore, the benefits of each type of firm tie not only vary across each other but will be moderated by market uncertainty such that certain types of ties will matter more or less under certain conditions. The paper claims that exploration and exploitation are two essential innovative models, under which firms need make a reasonable choice between them according the development stage, market environment and innovative targets.