ppxscal/embedding_network huggingface dataset:
The Nine Morse Generic Tetrahedra
Authors: D. Siersma, M. van Manen
Venue: SIAM Journal on Discrete Mathematics (2008)

There are two types of shapes for a generic triangle&mdash;acute and obtuse. These shapes are also distinguished by the (topological) Morse theory of the minimal distance function to the vertices. We can use the same method for a tetrahedron, and we show in this paper that there exist nine generic shapes. These can be described by a Morse poset or by a Gabriel graph. We also report on some computer experiments and compare our classification to another criterion used in computational geometry.
Recurrent Fuzzy CMAC for Nonlinear System Modeling
Authors: Floriberto Ortiz, Wen Yu, Marco Moreno-Armendariz, Xiaoou Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires huge memory and the dimension increases exponentially with the number of inputs. In this paper, we use recurrent technique to overcome these problems and propose a new CMAC neural network, named recurrent fuzzy CMAC (RFCMAC). Since the structure of RFCMAC is more complex, normal training methods are difficult to be applied. A new simple algorithm with a time-varying learning rate is proposed to assure the learning algorithm is stable.
Optimization Approach of Sintering Feature Parameter Based on Fuzzy SVM
Authors: Hui-yan Jiang, Yan Huo, Xiao-jie Zhou, Tian-you Chai
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The detection performance on the sintering state of the rotary kiln is mostly dependent on the features used in the recognition process. So an optimization approach of sintering feature parameters based on Fuzzy Support Vector Machines (SVM) is proposed. This method firstly uses many feature parameters to describe an image, and then reduce some useless features by Portfolio optimization algorithm which is mainly based on Relief theory. Secondly Fuzzy SVM technology is used for state recognition according to the effective retention features. Each feature is defined as a fuzzy degree, and the sintering state is got ultimately. The experiments show that this approach has strong robustness, high accuracy, and good feasibility.
Solving SQL Constraints by Incremental Translation to SAT
Authors: Robin Lohfert, James J. Lu, Dongfang Zhao
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

The need to model and solve constraints over large sets of relational data occurs frequently in practice. Naively and inefficiently, solutions to the problem may be implemented in ad-hoc and difficult to maintain procedural code that accesses the data through embedded SQL programming. More elegant solutions involve the use of declarative programming languages that integrates constraint modeling with database access in transparent ways. One of the more interesting constraint languages for relational databases is the language , proposed by Cadoli and Mancini, in which SQL and its relational algebraic foundation form the basis for expressing constraints. The current paper explores the feasibility of solving finite-domain constraints via a SAT solver backend.
A Supervised Learning Approach to Spanish Answer Validation
Authors: Alberto Téllez-Valero, Manuel Montes-Y-Gómez, Luis Villaseñor-Pineda
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)

This paper describes the results of the INAOE's answer va-lidation system evaluated at the Spanish track of the AVE 2007. The system is based on a supervised learning approach that considers two kinds of attributes. On the one hand, some attributes indicating the textual entailment between the given support text and the hypothesis constructed from the question and answer. On the other hand, some new features denoting certain answer restrictions as imposed by the question's type and format. The evaluation results were encouraging; they reached a F-measure of 53% (the best performance in the Spanish track), and outperformed the standard baseline by 15 percentage points.
A Particle Swarm Optimized Fuzzy Neural Network for Credit Risk Evaluation
Authors: Fu-yuan Huang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Neural networks (NNs) have been widely used to financial risk management because of their excellent performances of treating non-linear data with self-learning capability. However, the shortcoming of neural networks is also significant due to a "black box" syndrome and the difficulty in dealing with qualitative information, which limited its applications in practice. To overcome these drawbacks of NNs, in this study a particle swarm optimized fuzzy neural network (PSO-FNN) are proposed to evaluate credit risk. the results indicate that the predictive accuracies obtained from PSO-FNN are much higher than the ones obtained from NNs. To make this clearer, an illustrative example is also demonstrated in this study.
Emerging Sciences of the Internet: Some New Opportunities
Authors: Ron Brachman
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Semantic Web technologies have started to make a difference in enterprise settings and have begun to creep into use in limited parts of the World Wide Web. As is common in overview articles, it is easy to imagine scenarios in which the Semantic Web could provide important infrastructure for activities across the broader Internet. Many of these seem to be focused on improvements to what is essentially a search function (e.g., "list the prices of flat screen HDTVs larger than 40 inches with 1080p resolution at shops in the nearest town that are open until 8pm on Tuesday evenings" [http://en.wikipedia.org/wiki/Semantic_ Web]), and such capabilities will surely be of use to future Internet users. However, if one looks closely at the research agendas of some of the largest Internet companies, it is not clear that the staples of SW thinking will intersect the most important paths of the major broad-spectrum service providers. Some of the emerging trends in the research labs of key industry players indicate that SW goals generally taken for granted may be less central than envisioned and that the biggest opportunities may come from some less obvious directions. Given the level of investment and the global reach of big players like Yahoo! and Google, it would pay us to look more closely at some of their fundamental investigations. 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
Learning Ontologies of Appropriate Size
Authors: Elias Zavitsanos, Sergios Petridis, Georgios Paliouras, George A. Vouros
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

Determining the size of an ontology that is automatically learned from text corpora is an open issue. In this paper, we study the similarity between ontology concepts at different levels of a taxonomy, quantifying in a natural manner the quality of the ontology attained. Our approach is integrated in a recently proposed method for language-neutral learning of ontologies of thematic topics from text corpora. Evaluation results over the Genia and the Lonely Planet corpora demonstrate the significance of our approach.
Remaining Delivery Time Estimation Based Routing for Intermittently Connected Mobile Networks
Authors: Feng Liu, Ming Li, Run Zhang, He Zhang, Zhen Xu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

We propose Remaining Delivery Time Estimation based Routing (RDTER), a single-copy routing protocol for intermittently connected mobile networks. Nodes predict the Remaining Delivery Time (RDT) to each destination based on the distance estimations obtained from the recent two consecutive contact records. The distance estimation is set to be proportional to the inter-node encounter age, which is updated with transitivity upon each contact. Packet is forwarded to the encountered node whose RDT estimation to the destination is smaller. RDTER provides better forwarding direction, because a smaller RDT estimation means a node is more likely to meet the destination sooner. Thus the routing performance, especially the average delay could be improved. Simulations show that RDTER performs well under the random waypoint mobility model.
Global optimization method for combined spherical-cylindrical wrapping in musculoskeletal upper limb modelling
Authors: A. Audenaert, E. Audenaert
Venue: Computer Methods and Programs in Biomedicine (2008)

In musculoskeletal modelling, many muscles cannot be represented as straight lines from origin to insertion because the bony and musculotendinous morphology of neighboring structures causes them to wrap. The majority of these passive structures can be adequately described as simple geometric shapes such as spheres and cylinders. Techniques for describing smooth muscle paths around multiple obstacles have been developed for modelling use. Until now obstacle-set methods have combined the path of single structures. This does not analytically define the shortest smooth path around multiple objects. When a sphere is included in a multiple-object wrapping algorithm, muscle paths around that sphere are restricted to a bundle of planes containing the sphere center. This assumed restriction can compromise the iterative process for finding the true shortest muscle path that satisfies all restrictions of a smooth path. This can cause model instability. The new method involves the determination of the shortest smooth muscle path in a spherical and cylindrical wrapping algorithm. A typical example is musculoskeletal modelling of the upper limb, where the muscle fibers have to wrap over this combination of obstacles.
Self-forming Network Management Topologies in the Madeira Management System
Authors: Liam Fallon, Daryl Parker, Martin Zach, Markus Leitner, Sandra Collins
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

This paper describes a novel approach to network management topologies where multiple customized topologies are self-configured, self-optimized, and maintained automatically by the underlying network of elements. An implementation of these self-forming management topologies as developed in the Celtic European research project Madeira is described. The self-forming topologies use peer-to-peer communication facilities provided by the Madeira platform running on each network element and give a view of the complete network topology, with customization optimised for individual management functionality. Finally, experiences in utilising these topologies are described, highlighting the benefits of this novel approach.
Automatic detection of face and facial features
Authors: Chai Tong Yuen, M. Rizon, Woo San San, M. Sugisaka
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

An algorithm to automatically detect facial features from color images has been developed. First, face region is located using skin-color information. Then, the iris candidates are extracted from the intensity valleys created from the detected face. Next, the costs for each pair of iris candidates are computed to determine the real pair of irises. Mouth region and corners are detected using color space method, image processing and corners detection techniques. This algorithm has been tested to specifically reduce the effects of beard, moustache, hairstyle and facial expression in automated facial features detection.
Attribute Exploration Using Implications with Proper Premises
Authors: Heiko Reppe
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

We propose a variation of the attribute exploration algorithm. Instead of implications with pseudo-intents as premises our approach uses implications with proper premises. It is known that the set of implications with proper premises is complete, but in general it is not minimal in size. This variation will allow us to calculate all implications of a formal context with premise size at most n, for some fixed $n\in\mathbb N$. This is of interest if the attribute set is large and the user requests valid implications with small premises. Other applications can be seen for formal contexts where the maximal premise size of an implication with proper premise is known, for example multivalued contexts scaled by multiordinal scales only. 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
Stationary Distributions for the Random Waypoint Mobility Model
Authors: William Navidi Tracy Camp
Venue: IEEE Transactions on Mobile Computing (2004)

In simulations of mobile ad hoc networks, the probability distribution governing the movement of the nodes typically varies over time and converges to a "steady-state” distribution, known in the probability literature as the stationary distribution. Some published simulation results ignore this initialization discrepancy. For those results that attempt to account for this discrepancy, the practice is to discard an initial sequence of observations from a simulation in the hope that the remaining values will closely represent the stationary distribution. This approach is inefficient and not always reliable. However, if the initial locations and speeds of the nodes are chosen from the stationary distribution, convergence is immediate and no data need be discarded. We derive the stationary distributions for location, speed, and pause time for the random waypoint mobility model. We then show how to implement the random waypoint mobility model in order to construct more efficient and reliable simulations for mobile ad hoc networks. Simulation results, which verify the correctness of our method, are included. In addition, implementation of our method for the NS-2 simulator is available.
Synchronous Multiparty Synchronizations and Transactions
Authors: Ivan Lanese, Hernán Melgratti
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

In this paper we analyze how a powerful synchronization mechanism such as synchronous multiparty synchronizations, which is able to specify atomic reconfigurations of large systems, can be implemented using binary synchronizations combined with a transactional mechanism. To this aim we show a mapping from SHR, a graph transformation framework allowing multiparty synchronizations, to a generalization of Fusion Calculus featuring a transactional mechanism inspired by the Zero-Safe Petri nets. To complete the correspondence between the two formalisms we also present a mapping in the opposite direction.
Mobile Supercomputers
Authors: Todd Austin, David Blaauw, Scott Mahlke, Trevor Mudge, Chaitali Chakrabarti, Wayne Wolf
Venue: Computer (2004)

Current trends in computer architecture and power cannot meet the demands of mobile supercomputing. Significant innovation is required.
Computer Lessons from Pop Songs
Authors: Bob Colwell
Venue: Computer (2004)

Pop songs often have computer design secrets buried deeply in their lyrics. 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 Growing Divide in the Patterns World
Authors: Dragos Manolescu, Wojtek Kozaczynski, Ade Miller, Jason Hogg
Venue: IEEE Software (2007)

Microsoft's patterns & practices group conducted a survey that indicates a significant gap between the patterns expert community and the software practitioners attempting to use and leverage patterns in their daily work. As this gap widens, it will lead to an irreversible divide between the two communities, and patterns will fail to deliver their potential. Drawing on the authors' experience using patterns to package development guidance as well as input from practitioners using patterns, the article analyzes the key causes of this gap and recommends a set of actions aimed at pattern users in general and the patterns community in particular. Bridging this gap will dramatically improve practitioners' understanding of patterns and their ability to leverage them as the patterns expert community envisions. This article is part of a special issue on software patterns.
Workshop on Petri Nets and Graph Transformations
Authors: Paolo Baldan, Barbara König
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

The Workshop on Petri Nets and Graph Transformations, which is currently at its third edition, is focused on the mutual relationship between two prominent specification formalisms for concurrency and distribution, namely Petri nets and graph transformation systems. It belongs to folklore that Petri nets can be seen as rewriting systems over (multi)sets, the rewriting rules being the transitions, and, as such, they can be seen as special graph transformation systems, acting over labelled discrete graphs. The basic notions of Petri nets such as marking, enabling, firing, steps and step sequences can be naturally "translated" to corresponding notions of graph transformation systems. Due to this close correspondence there has been a mutual influence between the two fields, which has lead to a fruitful cross-fertilisation.
Characterizations of Total Dual Integrality
Authors: Edwin O'Shea, András Sebő
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

In this paper we provide new characterizing properties of TDI systems. A corollary is Sturmfels' theorem relating toric initial ideals generated by square-free monomials to unimodular triangulations. A reformulation of these test-sets to polynomial ideals actually generalizes the existence of square-free monomials to arbitrary TDI systems, providing new relations between integer programming and Gröbner bases of toric ideals. We finally show that stable set polytopes of perfect graphs are characterized by a refined fan that is a triangulation consisting only of unimodular cones, a fact that endows the Weak Perfect Graph Theorem with a computationally advantageous geometric feature. Three ways of implementing the results are described and some experience about one of these is reported.
An Adaptive Selection of the Scale and Orientation in Kernel Based Tracking
Authors: Qifeng Qiao, Dali Zhang, Yu Peng
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

A new approach to adapt the kernel scale and orientation in real-time tracking is proposed. The iterative procedure, mean shift, is the key point to find the most credible target location. Though it performs well in some bad conditions, such as camera motion, partial occlusions, and background clutters, it has limited performance on tracking the object with the changing size. In this paper, the adaptive filters were modified and integrated with the mean shift process to estimate both the object position and the matrix describing the kernel shape. The previous states on both the position and the matrix are used to predict and maintain a better approximation of the kernel scale and orientation. Some experiments prove the superior performance of our new method. It has advantages in tracking the objects changing in scale or orientation and is less prone to the background clutter and occlusions.
FRFT Based Transmultiplexers
Authors: George Kwamina Aggrey, Ran Tao
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Transmultiplexers, the basis of which is filter banks, have been successfully utilized for multiuser communications. One important limitation however, is the leakage of signal from one channel to another known as crosstalk. This occurs because the core elements, synthesis and analysis filters employed are nonideal. To minimize its effect has been the focus of transmultiplexer design. This study therefore investigates a new approach to transmultiplexer design using the FRFT based filter banks in the processing of nonstationary signals. This method can enhance the elimination of the crosstalk and amplitude distortion.
The Cost of Convenience: A Faustian Deal
Authors: Michael A. Caloyannides
Venue: IEEE Security and Privacy (2004)

The greatest threat to security is not privacy but convenience. In our love affair with new technologies, it's easy to forget that our handy devices affect our privacy in more ways than we know. Being informed about the risks is a key first step toward privacy protection, but there are many other things we can do to keep the information about our activities a little more within our own control.
Achieving Business Process Flexibility with Business Rules
Authors: Tim van Eijndhoven, Maria-Eugenia Iacob, María Laura Ponisio
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Business processes used in networked business are often large and complex, which makes them difficult to manage and change. In this paper we address this lack of flexibility by proposing a solution that uses business rules and workflow patterns to model the variable parts of process flow, thus facilitating dynamic pattern composition in these areas. We argue that the increase in flexibility is justified by the fact that changes in a business process can be confined to the variable isolated parts of the process.
Independence---domination duality
Authors: Ron Aharoni, Eli Berger, Ron Holzman, Ori Kfir
Venue: Journal of Combinatorial Theory Series B (2008)

Given a system G=(G"1,G"2,...,G"m) of m graphs on the same vertex set V, define the ''joint independence number''@a"@?(G) as the maximal size of a set which is independent in all graphs G"i. Let also @c"@?(G) be the ''collective domination number'' of the system, which is the minimal number of neighborhoods, each taken from any of the graphs G"i, whose union is V. Konig's classical duality theorem can be stated as saying that if m=2 and both graphs G"1,G"2 are unions of disjoint cliques then @a"@?(G"1,G"2)=@c"@?(G"1,G"2). We prove that a fractional relaxation of @a"@?, denoted by @a"@?^*, satisfies the condition @a"@?^*(G"1,G"2)>=@c"@?(G"1,G"2) for any two graphs G"1,G"2, and @a"@?^*(G"1,G"2,...,G"m)>2m@c"@?(G"1,G"2,...,G"m) for any m>2 and all graphs G"1,G"2,...,G"m. We prove that the convex hull of the (characteristic vectors of the) independent sets of a graph contains the anti-blocker of the convex hull of the non-punctured neighborhoods of the graph and vice versa. This, in turn, yields @a"@?^*(G"1,G"2,...,G"m)>=@c"@?^*(G"1,G"2,...,G"m) as well as a dual result. All these results have extensions to general simplicial complexes, the graphical results being obtained from the special case of the complexes of independent sets of graphs.