ppxscal/embedding_network huggingface dataset:
Co-operative Animation: Beyond Creative Visualization in Automotive Design
Authors: Jean Michel Raad, Sean Mccartan, Mike Tovey, Andree Woodcock
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

This paper explores the teaching and learning opportunities provided by an eight week, co-operative animation placement for third year undergraduate students in industrial design.
CORAS for the Research of ISAC
Authors: Ya-Ping Fu, Kwo-Jean Farn, Chung-Huang Yang
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The development of the Internet has elicited the importance of information security. For national information security, other than providence and release of information security protection messages, critical infrastructure information protection (CIIP) has also become part of the overall network security. How to integrate the related information security data for industries and establish the integrative monitoring and analytical platform is the first priority at Taiwan. Hence, the establishment of the Information Sharing and Analysis Center (ISAC) for critical infrastructures has become the most important topic at present. The ISAC establishment places the greatest emphasis on information exchange and analysis so that there must be a unified standard for the exchange format and operation. Because the differences between critical infrastructures are quite large and the sources of the workflow processes and threats are not quite the same, a public tool is required for such establishment. This research discusses how to use Consultative Objective Risk Analysis System (CORAS) to establish ISAC of critical infrastructures and takes a telecom company as an example to simulate episodes of possible risks that might occur and to discuss how it functions, how it is established, and how it handles risks.
A Model-Driven Approach for A-posteriori Tool Integration
Authors: W. Marquardt, M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The following section discusses the long-term approach of IMPROVE. We start with a careful analysis of current design processes in chemical engineering and their insufficient support by tools. Then, we sketch how new ideas from the engineering and informatics side can considerably improve the state-of-the-art. The resulting tools according to these new ideas are sketched in the next section.It should be remarked that both, the long-term goals and the principal approach of IMPROVE [343], were not changed within the whole project period, i.e. --- if also counting preliminary phases of the project --- within a duration of 11 years. This stability of goals and approach shows that we have addressed a fundamental and hard problem which cannot be solved in a short period. It, furthermore, shows that the undertaken approach went in the right direction. Therefore, it was not necessary to revise the approach within the whole project period, neither in total nor in essential parts.
Link-Contexts for Ranking
Authors: Jessica Gronski
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Anchor text has been shown to be effective in ranking [6] and a variety of information retrieval tasks on web pages. Some authors have expanded on anchor text by using the words around the anchor tag, a link-context, but each with a different definition of link-context. This lack of consensus begs the question: What is a good link-context?The two experiments in this paper address the question by comparing the results of using different link-contexts for the problem of ranking. Specifically, we concatenate the link-contexts of links pointing to a web page to create a link-context document used to rank that web page. By comparing the ranking order resulting from using different link-contexts, we found that smaller contexts are effective at ranking relevant urls highly. 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
Stemming Approaches for East European Languages
Authors: Ljiljana Dolamic, Jacques Savoy
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)

During this CLEF evaluation campaign, the first objective is to propose and evaluate various indexing and search strategies for the Czech language that will hopefully result in more effective retrieval than language-independent approaches (n-gram). Based on the stemming strategy we developed for other languages, we propose that for the Slavic language a light stemmer (inflectional only) and also a second one based on a more aggressive suffix-stripping scheme that will remove some derivational suffixes. Our second objective is to undertake further study of the relative merit of various search engines when exploring Hungarian and Bulgarian documents. To evaluate these solutions we use various effective IR models. Our experiments generally show that for the Bulgarian language, removing certain frequently used derivational suffixes may improve mean average precision. For the Hungarian corpus, applying an automatic decompounding procedure improves the MAP. For the Czech language a comparison of a light and a more aggressive stemmer to remove both inflectional and some derivational suffixes, reveals only small performance differences. For this language only, performance differences between a word-based or a 4-gram indexing strategy are also rather small.
Graphics in Workstations-Emerging Systems and Solutions
Authors: Jon Reed
Venue: IEEE Computer Graphics and Applications (1984)

A combination of basic technologies that are already in place will enable the workstation environment to improve productivity at every stage of product development. 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
Hybrid Intelligent Modeling Approach for the Ball Mill Grinding Process
Authors: Ming Tie, Jing Bi, Yushun Fan
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Modeling for the ball mill grinding process is still an imperative but difficult problem for the optimal control of mineral processing industry. Due to the integrated complexities of grinding process (strong nonlinearity, unknown mechanisms, multivariable, time varying parameters, etc.), a hybrid intelligent dynamic model is presented in this paper, which includes a phenomenological ball mill grinding model with a neurofuzzy network to describe the selection function of different operating conditions, a populace balance based sump model, a phenomenological hydrocyclone model with some reasoning rules for its parameters correction and a radius basis function network (RBFN) for fine particle size error compensation. With the production data from a ball mill grinding circuit of an iron concentration plant, the experiments and simulation results show the proposed hybrid intelligent modeling approach effective.
Off-Line Keyword Guessing Attacks on Recent Public Key Encryption with Keyword Search Schemes
Authors: Wei-Chuen Yau, Swee-Huay Heng, Bok-Min Goi
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

The Public Key Encryption with Keyword Search Scheme (PEKS) was first proposed by Boneh et al. in 2004. This scheme solves the problem of searching on data that is encrypted using a public key setting. Recently, Baek et al. proposed a Secure Channel Free Public Key Encryption with Keyword Search (SCF-PEKS) scheme that removes the secure channel for sending trapdoors. They later proposed another improved PEKS scheme that integrates with a public key encryption (PKE) scheme, called PKE/PEKS. In this paper, we present off-line keyword guessing attacks on SCF-PEKS and PKE/PEKS schemes. We demonstrate that outsider adversaries that capture the trapdoors sent in a public channel can reveal encrypted keywords by performing off-line keyword guessing attacks. While, insider adversaries can perform the attacks regardless the trapdoors sent in a public or secure channel.
Dynamic PSO-Neural Network: A Case Study for Urban Microcosmic Mobile Emission
Authors: Chaozhong Wu, Chengwei Xu, Xinping Yan, Jing Gong
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Road traffic is widely accepted as being a substantial source of air pollution in urban environments. It is necessary to understand the real-world emission factors and identify the operational factors related to emissions. The objective of this study was to develop a particle swarm optimization (PSO)-neural network method for uncovering the relationship between operational status and emission rates. First, a neural network model was proposed to express the relationship between operational status of vehicles and their emission rates (include nitrogen oxides (NOx), hydrocarbon (HC) and carbon monoxide (CO)). The training of neural network is convergent through introducing dynamic searching particle swarm optimization method. A case study in Wuhan city was developed to test the applicability of the proposed model. The results indicate that the dynamic searching particle swarm optimization method can generate more useful solutions than the basic particle swarm optimization method.
WebWorkFlow: An Object-Oriented Workflow Modeling Language for Web Applications
Authors: Zef Hemel, Ruben Verhaaf, Eelco Visser
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Workflow languages are designed for the high-level description of processes and are typically not suitable for the generation of complete applications. In this paper, we present WebWorkFlow, an object-oriented workflow modeling language for the high-level description of workflows in web applications. Workflow descriptions define procedures operating on domain objects. Procedures are composed using sequential and concurrent process combinators. WebWorkFlow is an embedded language, extending WebDSL, a domain-specific language for web application development, with workflow abstractions. The extension is implemented by means of model-to-model transformations. Rather than providing an exclusive workflow language, WebWorkFlow supports interaction with the underlying WebDSL language. WebWorkFlow supports most of the basic workflow control patterns.
Parallel Monte-Carlo Tree Search
Authors: Guillaume M. Chaslot, Mark H. Winands, H. Jaap Herik
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techniques: adequately handling of (1) local mutexes and (2) virtual loss. Experiments in 13×13 Go reveal that in the program Mango root parallelization may lead to the best results for a specific time setting and specific program parameters. However, as soon as the selection mechanism is able to handle more adequately the balance of exploitation and exploration, tree parallelization should have attention too and could become a second choice for parallelizing MCTS. Preliminary experiments on the smaller 9×9 board provide promising prospects for tree parallelization.
A Heuristic Particle Swarm Optimization for Cutting Stock Problem Based on Cutting Pattern
Authors: Xianjun Shen, Yuanxiang Li, Jincai Yang, Li Yu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

A heuristic particle swarm optimization (HPSO) is proposed as a solution to one-dimensional cutting stock problem (1D-CSP), which incorporate genetic operators into particle swarm optimization (PSO). In this paper, a heuristic strategy that is based on the results of analysis of the optimal cutting pattern of particles with successful search processes is described, which process a global optimization problem of the cutting-stock as a sequential optimization problem by multiple stages. During every sequential stage, the best cutting pattern for the current situation is researched and processed. This strategy is repeated until all the required stocks have been generated. The simulation results prove the effectiveness of the proposed methodology.
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
Authors: Ryan Dixon, Ömer Eğecioğlu, Timothy Sherwood
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

Bit-splitting breaks the problem of monitoring traffic payloads to detect the occurrence of suspicious patterns into several parallel components, each of which searches for a particular bit pattern. We analyze bit-splitting as applied to Aho-Corasick style string matching. The problem can be viewed as the recovery of a special class of regular languages over product alphabets from a collection of homomorphic images. We use this characterization to prove correctness and to give space bounds. In particular we show that the NFA to DFA conversion of the Aho-Corasick type machine used for bit-splitting incurs only linear overhead.
Nonlinear Complex Neural Circuits Analysis and Design by q-Value Weighted Bounded Operator
Authors: Hong Hu, Zhongzhi Shi
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Dynamical analysis of complex neural circuits, especially for chaotic nonlinear neural circuits is a difficult task. In this paper, a novel approach to understand the nonlinear dynamic attributes of a neural circuit by using approximate logical model of q-Value Weighted Bounded Operator is discussed, and we proved that if a neural circuit works in a non-chaotic way, a suitable fuzzy logical framework which is an approximate logical model of neural cells can be found and we can analyze or design such kind neural circuit similar to analyze or design a digit computer, but if a neural circuit works in a chaotic way, fuzzy logical frameworks of neural cells are different under different precisions, we should use a multi scale approximate police(see Def.5) for understanding the function of such neural system with arbitrary small precisions.
Decomposition of Information for Plant Collaborative Design and Set-Up
Authors: Dariusz Choinski, Mieczyslaw Metzger, Witold Nocon
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

A problem of coordinating engineers working in different fields during design and control of an industrial installation is especially difficult during start up and modification of the process. Any work carried out in such a case must be coordinated in real time. Moreover, level of access to information is differentiated for different branches of engineers. In this work a hybrid agent-based system for cooperative plant design and set up of the biotechnological pilot plant is proposed. The major contribution deals with decomposition of biotechnological plant information by hybrid agent system for enhancing cooperation of experts having different knowledge about the process. Hybridization of the process is performed considering nine states, while estimation of the information distance is performed based on partial Kullback-Liebler cross-entropy function. Experience gained during design and exploitation of the mentioned biotechnological pilot-plant suggests this solution to be promising.
Neuro-evolutionary Decision Support System for Financial Time Series Analysis
Authors: Piotr Lipinski
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper proposes a hybrid decision support system for financial time series analysis. It uses evolutionary algorithms to construct an artificial expert, consisting of some expert rules, which processes financial time series and provides an expertise. Such expert rules are either static coming from the domain knowledge or are in the form of multi-layer perceptrons representing expert rules extracted from data.Results of a large number of experiments on real-life data from the Paris Stock Exchange confirm that the model of the hybrid decision support system is reasonable and it is able to generate reasonable solutions, not only over a training period, used in the training process, but also over a test period, unknown during constructing artificial experts.
Extractors for Three Uneven-Length Sources
Authors: Anup Rao, David Zuckerman
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We construct an efficient 3-source extractor that requires one of the sources to be significantly shorter than the min-entropy of the other two sources. Our extractors work even when the longer, n-bit sources have min-entropy n ¿(1) and the shorter source has min-entropy log10 n. Previous constructions for independent sources with min-entropy n ¿ required ¿(1/¿) sources [Rao06]. Our construction relies on lossless condensers [GUV07] based on Parvaresh-Vardy codes [PV05], as well as on a 2-source extractor for a block source and general source [BRSW06].
Managing an NFC Ecosystem
Authors: Gerald Madlmayr, Josef Langer, Josef Scharinger
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Whereas several NFC trials are already established around the world, currently there are no mass rolls out yet. This is due to several technical as well as administrative issues that have to be dealt with before rolling out such a system. In this paper we present an approach for managing the B2B relations in an Near Field Communication (NFC) Ecosystem offering services based on card emulation like loyalty, payment and ticketing. Out of experiences made from trials we show which services are needed in order to manage such an ecosystem and to provide convenience to the user. Further more we discuss functional aspects of such an ecosystem, the parties involved as well as their benefit for participating. Although the technology already given allows a smooth interaction for the consumer, the infrastructure behind the scene is complex and requires the cooperation on different levels to ensure interoperability and a thriving contactless scheme to be deployed.
Gradient Vector Flow Field and Mass Region Extraction in Digital Mammograms
Authors: Fengmei Zou, Yufeng Zheng, Zhengdong Zhou, Kwabena Agyepong
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Mass detection is one of the main computer-aided mammographic breast cancer detection techniques. Precisely selecting the regions that contain masses is an important step in mass segmentation using mammographic computer-aided detection. In this paper, an algorithm for extracting mass regions in digital mammograms is proposed, in which we use adaptive histogram equalization to enhance mammograms, use a gradient vector flow field to generate region boundaries, select N candidate locations according to the means and the standard deviations of intensities of the points with top brightness, use these points and the region boundaries to generate the convex hulls of the regions as the mass regions. 161 down-sampled mammogram images from the Digital Database for Screening Mammography project were test, and a detection rate of 82.6% is obtained. The experimental results indicated that the method is efficient and robust.
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
Authors: Lars Otten, Rina Dechter
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

We present measures for bounding the instance-based complexity of AND/OR search algorithms for solution counting and related #P problems. To this end we estimate the size of the search space, with special consideration given to the impact of determinism in a problem. The resulting schemes are evaluated empirically on a variety of problem instances and shown to be quite powerful.
The Past, Present, and Future of IEC 61499
Authors: Alois Zoitl, Thomas Strasser, Ken Hall, Ray Staron, Christoph Sünder, Bernard Favre-Bulle
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

In 1991, Technical Committee 65 (TC65) of the International Electrotechnical Commission (IEC) approved a New Work Item (NWI) for the development of an international standard for the use of software objects known as Function Blocks (FBs) in distributed Industrial-Process Measurement and Control Systems (dIPMCS). The need for this new standard resulted out of several studies and research programs that have been started or conducted in the late eighties and early nineties of the last century. IEC 61499 got finally standardized in January 2005. Before that, since 2000, it was available in the form of a so-called Public Available Specification (PAS). Although IEC 61499 has been available for so long, up to now most published work on it has been academic or resulted only in prototypical test cases. Most activities around the IEC 61499 standard have been in standardization of the execution environment and definition of semantics. Some current research is in pursuing design and coding tools. This paper gives and overview about the past and present activities and implementations related to IEC 61499 and discusses the potential of this new standard for future application scenarios.
Atmospheric Turbulence Effects Removal on Infrared Sequences Degraded by Local Isoplanatism
Authors: Magali Lemaitre, Olivier Laligant, Jacques Blanc-Talon, Fabrice Mériaudeau
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

When observing an object horizontally at a long distance, degradations due to atmospheric turbulence often occur. Different methods have already been tested to get rid of this kind of degradation, especially on infrared sequences. It has been shown that the Wiener filter applied locally on each frame of a sequence allows to obtain good results in terms of edges, while the regularization by the Laplacian operator applied in the same way provides good results in terms of noise removal in uniform areas. In this article, we present hybrid methods which take advantages of both Wiener filter and Laplacian regularization.