ppxscal/embedding_network huggingface dataset:
Shape feature control in structural topology optimization
Authors: Shikui Chen, Michael Yu Wang, Ai Qun Liu
Venue: Computer-Aided Design (2008)

A variational approach to shape feature control in topology optimization is presented in this paper. The method is based on a new class of surface energies known as higher-order energies as opposed to the conventional energies for problem regularization, which are linear. In employing a quadratic energy functional in the objective of the topology optimization, non-trivial interactions between different points on the structural boundary are introduced, thus favoring a family of shapes with strip-like (or beam) features. In addition, the quadratic energy functional can be seamlessly integrated into the level set framework that represents the geometry of the structure implicitly. The shape gradient of the quadratic energy functional is fully derived in the paper, and it is incorporated in the level set approach for topology optimization. The approach is demonstrated with benchmark examples of structure optimization and compliant mechanism design. The results presented show that this method is capable of generating strip-like (or beam) designs with specified feature width, which have highly desirable characteristics and practical benefits and uniquely distinguish the proposed method.
Identification of More Characteristic Dynamic Patterns in a WWTP by ClBR×E
Authors: Karina Gibert, Gustavo Rodríguez Silva
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this work, advances in the design of an hybrid methodology that combines tools of Artificial Intelligence and Statistics to extract a model of explicit knowledge are presented in regards to the dynamics of a Wastewater Treatment Plant. Our line of work is based in the development of methodologies of AI Stats to solve problems of Knowledge Discovery of Data where an integral vision of the pre-process, the automatic interpretation of results and the explicit production of knowledge play a role as important as the analysis itself. In our current work the identification of more characteristic dynamic patterns is approached with Clustering Based on Rules by States, which consists in the analysis of the stages that the water treatment moves through, to integrate the knowledge discovered from each subprocess into a unique model of global operation of the phenomenon.
A family of higher-order numerical schemes for the convection-diffusion equation in conservation form
Authors: Brian J. McCartin, Michael W. Fisackerly
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

In this paper, we introduce a class of compact, higher-order, exponentially-fitted discretizations of the steady, one-dimensional convection-diffusion equation in conservation form. This will be achieved by employing the Mehrstellenverfahren technique of L. Collatz. These new schemes are shown to be uniformly second order accurate in the small parameter ε (the diffusion). The fourth-order accurate member of this family of schemes is studied in detail. Theoretical and numerical comparisons will be made to the methods of Allen-Southwell, El-Mistikawy-Werle, Leventhal, and Gartland. Additional examples exercising this new scheme are presented.
Real-time tracking for sensor networks via sdp and gradient method
Authors: Zizhuo Wang, Yichuan Ding
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

The sensor tracking problem is an important problem studied in many different fields. But many of those studies use analysis or machine learning method rather than optimization method. Recently, several approaches have been proposed to solve the static version of the tracking problem, the sensor network localization problem, via Semi-definite Programming(SDP). In this paper, we analyze a new real-time sensor tracking scheme by combining the SDP approach and the gradient method. We show that this approach provides fast and accurate tracking for network sensors. We also discuss the problem of extracting information from the moving sensors, which could be used to predict their movements.
Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems
Authors: Nazim Fatès, Lucas Gerin
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We study the convergence properties of cellular automata under fully asynchronous updating, i.e., when a single cell is selected at random at each time unit. We tackle this question for the two-dimensional totalistic cellular automata. As a first step for studying this class, we focus on a few examples that are, in our view, representative of the diversity of the behaviours found in dimension two. The richness of the evolutions we consider underlines that the updating scheme plays a central role in the evolution of a cellular automaton.
Catastrophe Prediction of Cnaphalocrosis Medinalis Based on Fuzzy Reasoning
Authors: Fei Yu, Yue Shen, Guangxue Yue, Ronghui Wu, Cheng Xu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The pest catastrophe prediction in ecology catastrophe is one of important part in expert system of intelligence agriculture and also the guarantee for preventing and controlling the pest catastrophe occurrence efficiently. The paper introduces the basic principles and methods of current catastrophe prediction in ecology catastrophe. According to modeling for the dynamic process of population, up-grown and amount of spawn, the paper finds out the trigger point and critical value inducing the pest catastrophe and implements the catastrophe prediction of Cnaphalocrosis Medinalis, which take measures before catastrophe to prevent big population coming into being.
Increasing Confidence in Concurrent Software through Architectural Analysis
Authors: Robert G. Pettit,  Iv
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

Mission critical real-time and embedded software systems often use significant degree of concurrency within their architecture designs. Experience has shown that common problems surrounding the design of these systems include underspecified performance requirements; underspecified state-dependent behavior; and inadequately capturing concurrent interactions. Dynamic architectural models capturing the overall behavioral properties of the software system are often constructed using ad hoc techniques with little consideration given to the resulting performance or implications of concurrent behavior until the project reaches implementation. To address this issue and thus increase the confidence that a concurrent software architecture design will behave as desired, we have developed an approach to augment UML-based software designs with colored Petri nets, thus increasing the analytical capabilities at design time. An illustration of this approach using a rover control case study is included in this paper.
Prime graphs and exponential composition of species
Authors: Ji Li
Venue: Journal of Combinatorial Theory Series A (2008)

In this paper, we enumerate prime graphs with respect to the Cartesian multiplication of graphs. We use the unique factorization of a connected graph into the product of prime graphs given by Sabidussi to find explicit formulas for labeled and unlabeled prime graphs. In the case of species, we construct the exponential composition of species based on the arithmetic product of species of Maia and Mendez, and express the species of connected graphs as the exponential composition of the species of prime graphs.
Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem
Authors: Rym M'Hallah, Ali Alhajraf
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This paper proposes an ant colony optimization hybrid heuristic (ACH) for the total earliness tardiness single machine scheduling problem where jobs have different processing times and distinct due dates, and the machine can not be idle. ACH is an ant colony system with daemon actions that intensify the search around good quality solutions. The computational results show the effectiveness of ACH.
A Multiple Kernel Learning Approach to Joint Multi-class Object Detection
Authors: Christoph H. Lampert, Matthew B. Blaschko
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

Most current methods for multi-class object classification and localization work as independent 1-vs-rest classifiers. They decide whether and where an object is visible in an image purely on a per-class basis. Joint learning of more than one object class would generally be preferable, since this would allow the use of contextual information such as co-occurrence between classes. However, this approach is usually not employed because of its computational cost.In this paper we propose a method to combine the efficiency of single class localization with a subsequent decision process that works jointly for all given object classes. By following a multiple kernel learning (MKL) approach, we automatically obtain a sparse dependency graph of relevant object classes on which to base the decision. Experiments on the PASCAL VOC 2006 and 2007 datasets show that the subsequent joint decision step clearly improves the accuracy compared to single class detection.
An investigation of credit-based flow control protocols
Authors: Jonathan Billington, Smit Saboo
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Credit-based flow control mechanisms, such as those used in the Transmission Control Protocol, allow flow control and error control procedures of data transfer protocols to operate independently. We create a Coloured Petri Net model of a class of data transfer protocols, which uses retransmissions and acknowledgements for error control and "credits" for flow control. This model is characterized by 3 parameters: the maximum sequence number, the maximum number of retransmissions and the maximum receiver buffer size. From the analysis results, we derive expressions in these parameters for the channel bounds and the number of terminal states. These expressions are verified for a range of values of the parameters.
Two New Families of Low-Correlation Interleaved QAM Sequences
Authors: Gagan Garg, P. Vijay Kumar, C. E. Madhavan
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Two families of low correlation QAM sequences are presented here. In a CDMA setting, these sequences have the ability to transport a large amount of data as well as enable variable-rate signaling on the reverse link.The first family ${\cal I}^2{\cal SQ - B}$ is constructed by interleaving 2 selected QAM sequences. This family is defined over M 2-QAM, where M = 2 m , m ¿ 2. Over 16-QAM, the normalized maximum correlation $\overline{\theta}_{\max}$ is bounded above by $ \lesssim 1.17 \, \sqrt{N}$, where N is the period of the sequences in the family. This upper bound on $\overline{\theta}_{\max}$ is the lowest among all known sequence families over 16-QAM.The second family ${\cal I}^4{\cal SQ}$ is constructed by interleaving 4 selected QAM sequences. This family is defined over M 2-QAM, where M = 2 m , m ¿ 3, i.e., 64-QAM and beyond. The $\overline{\theta}_{\max}$ for sequences in this family over 64-QAM is upper bounded by $ \lesssim 1.60 \, \sqrt{N}$. For large M, $\overline{\theta}_{\max} \lesssim 1.64 \, \sqrt{N}$. These upper bounds on $\overline{\theta}_{\max}$ are the lowest among all known sequence families over M 2-QAM, M = 2 m , m ¿ 3.
The Explicit Exploration Information Exchange Mechanism for Niche Technique
Authors: Jun Zhang, Kwok-Wing Chau
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper presents a novel explicit exploration information exchange mechanism for niche technique. In this framework, the whole population is divided into many sub-populations. The different sub-population communicates with each other. One sub-population exploration area does not be explored by others. Based on this framework, a multi-sub-swarm particle swarm optimization (MSSPSO) algorithm is implemented to test the thought. Five benchmark multimodal functions are used as test functions. The experimental results show that the proposed method has a stronger adaptive ability and a better performance for multimodal functions with respect to other niche techniques.
Fuzzy Analytical Hierarchy Process in Maintenance Problem
Authors: Ma Socorro García-Cascales, Ma Teresa Lamata
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This paper proposes the use of Multi-Criteria Analysis for management maintenance processes where only linguistic information was available because this was the type of data provided by the company. We are interested on the problems related to pieces with diverse degrees of dirt. In this direction, we propose and evaluate a maintenance decision problem in an engine factory that is specialized in production, sale and maintenance of four stroke engines; medium and slow speed. In our case, Multiple Criteria Decision-Making refers to making optimal decisions over a finite number of available alternatives and criteria.
Development of e-government in Slovenia
Authors: Mirko Vintar, Mateja Kunstelj, Mitja Dečman, Boštjan Berčič
Venue: Information Polity (2003)

E-government has been a hot topic in the public administration research community for some time now. While still considered by some to be merely a technological phenomenon, it also includes organisational changes in public administration, development and implementation of new business processes, discovering better and faster ways of providing public services and offering entirely new services, not known before. In this article we try to look at the development of e-government in Slovenia from both perspectives, technological and organisational. We explore the public administration presence on the Internet, the services it provides and the back-office systems that support them. The current state of electronic services provided by various public administration bodies is examined, both from the end user's perspective and from a technological point of view. We present the current state of e-government with respect to the action plans it has committed itself, while relying on well-known methodology adopted by the European Commission.
Identifying Spam Web Pages Based on Content Similarity
Authors: Maria Soledad Pera, Yiu-Kai Ng
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

The Web provides its users with abundant information. Unfortunately, when a Web search is performed, both users and search engines are faced with an annoying problem: the presence of misleading Web pages, i.e., spam Web pages, that are ranked among legitimate Web pages. The mixed results downgrade the performance of search engines and frustrate users who are required to filter out useless information. In order to improve the quality of Web searches, the number of spam pages on the Web must be reduced, if they cannot be eradicated entirely. In this paper, we present a novel approach for identifying spam Web pages that have mismatched titles and bodies and/or low percentage of hidden content. By considering the content of Web pages, we develop a spam-detection tool that is (i) reliable, since we can accurately detect 94% of spam/legitimate Web pages, and (ii) computational inexpensive, since the word-correlation factors used for content analysis are precomputed. We have verified that our spam-detection approach outperforms existing anti-spam methods by an average of 10% in terms of F-measure.
Electronic contracting in aircraft aftercare: a case study
Authors: Felipe Meneguzzi, Simon Miles, Michael Luck, Camden Holt, Malcolm Smith
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

Distributed systems comprised of autonomous self-interested entities require some sort of control mechanism to ensure the predictability of the interactions that drive them. This is certainly true in the aerospace domain, where manufacturers, suppliers and operators must coordinate their activities to maximise safety and profit, for example. To address this need, the notion of norms has been proposed which, when incorporated into formal electronic documents, allow for the specification and deployment of contract-driven systems. In this context, we describe the CONTRACT framework and architecture for exactly this purpose, and describe a concrete instantiation of this architecture as a prototype system applied to an aerospace aftercare scenario.
JADE/LEAP Agents in an Aml Domain
Authors: Nayat Sánchez-Pi, Javier Carbó, José Manuel Molina
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Ambient intelligence, ubiquitous computing and other new concepts related are in some sense a projection of the new wireless technologies and the mobile phenomenon where the user mobility and the communicating smart devices are immersed nowadays. In this paper, we propose a multi-agent system architecture and its implementation for the provisioning of context-aware services in an ambient intelligence domain: an airport.
Framework for Workflow Gridication of Genetic Algorithms in Java
Authors: Boro Jakimovski, Darko Cerepnalkoski, Goran Velinov
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

In this paper we present new Java framework for Gridification of Genetic Algorithms. The framework enables easy implementation of Genetic Algorithms and also enables researchers easy and stable usage of the Grid for their deployment. The design of the framework was based on principles that make it very open and extensible. The Grid components use pure Java implementation of Grid job submission and retrieval for the Glite grid middleware by using Web Services (WS). The framework was tested on the SEEGRID testbed. Using this framework we have developed a pilot application for optimizing data warehousing VIS problem.
CoCoME in SOFA
Authors: Tomáš Bureš, Martin Děcký, Petr Hnětynka, Jan Kofroň, Pavel Parízek, František Plášil, Tomáš Poch, Ondřej Šerý, Petr Tůma
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

This chapter presents our solution to the CoCoME assignment that is based on the SOFA 2.0 (SOFtware Appliances) hierarchical component model. The solution involves (i) modeling architecture in SOFA meta-model, (ii) speci fication of component behavior via extended behavior protocols, (iii) checking behavior compliance of components, (iv) verification of correspondence be tween selected component Java code and behavior specification, (v) deploy ment to SOFA run-time envi ronment (using connectors that support RMI and JMS), and (vi) modeling of performance and resource usage via layered queue ing networks. We faced sev eral issues during implementation of the CoCoME assignment in SOFA 2.0. Most notably, the architecture was modified in order to improve clarity of the design --- in particular, the hierarchical bus was re placed by two separate buses and the Inventory component was restructured. Extended behavior protocols for all the components are based on the provided plain-English use cases, the UML sequence diagrams, and the reference Java implementation (the assignment does not include a complete UML behavior specification e.g. via activity dia grams and state charts).
An(other) Entropy-Bounded Compressed Suffix Tree
Authors: Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

Suffix trees are among the most important data structures in stringology, with myriads of applications. Their main problem is space usage, which has triggered much research striving for compressed representations that are still functional. We present a novel compressed suffix tree. Compared to the existing ones, ours is the first achieving at the same time sublogarithmic complexity for the operations, and space usage which goes to zero as the entropy of the text does. Our development contains several novel ideas, such as compressing the longest common prefix information, and totally getting rid of the suffix tree topology, expressing all the suffix tree operations using range minimum queries and a new primitive called next/previous smaller value in a sequence.
Distribution lines overload control to increase reliability and power loss reduction
Authors: Shrirang Karandikar, Ashok Ghatol
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

The Indian Power sector is currently undergoing sea change. The pace of economic development along with increasing power demand would require additional generating capacity. Simultaneously increased efficiency in the sector can help in the task of achieving the National perspective of power to everyone by the year 2012. The distribution system in India is normally having four voltage levels. In this three are for high tension and one for low tension. The distribution system performance is normally controlled by either voltage regulation at the farthest end of the distribution line or thermal limitation of the current carrying conductor of such distribution line. In this paper the study of 22 kV distribution lines in high load density area, exceeding thermal limitation are studied. The observation of the study are utilised to solve practical problem of power loss and reliability in the said area. These have achieved the desired results and can also be applied to similar such areas.
Learning Language from Its Perceptual Context
Authors: Raymond J. Mooney
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Current systems that learn to process natural language require laboriously constructed human-annotated training data. Ideally, a computer would be able to acquire language like a child by being exposed to linguistic input in the context of a relevant but ambiguous perceptual environment. As a step in this direction, we present a system that learns to sportscast simulated robot soccer games by example. The training data consists of textual human commentaries on Robocup simulation games. A set of possible alternative meanings for each comment is automatically constructed from game event traces. Our previously developed systems for learning to parse and generate natural language (KRISP and WASP) were augmented to learn from this data and then commentate novel games. The system is evaluated based on its ability to parse sentences into correct meanings and generate accurate descriptions of game events. Human evaluation was also conducted on the overall quality of the generated sportscasts and compared to human-generated commentaries.