ppxscal/embedding_network huggingface dataset:
Crystal graphs for general linear Lie superalgebras and quasi-symmetric functions
Authors: Jae-Hoon Kwon
Venue: Journal of Combinatorial Theory Series A (2009)

We give a new representation theoretic interpretation of the ring of quasi-symmetric functions. This is obtained by showing that the super analogue of Gessel's fundamental quasi-symmetric function can be realized as the character of a connected crystal for the Lie superalgebra gl"n"|"n associated to its non-standard Borel subalgebra with a maximal number of odd isotropic simple roots. We also present an algebraic characterization of these super quasi-symmetric functions.
True Event Decision by Cooperative Sensor Network
Authors: Pei-Lin Hou, Chia-Shin Yen, Chien-Ming Wu, Kun-Cheng Tsai
Venue: Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware (2009)

The rise of WSN (Wireless Sensor Network) and widely adopted WSN services on environmental monitoring make our lives safer. To bring higher level of intelligent services into lives, integration of various networking services in one area is a must. For example, in traditional security camera system, object stolen event is only handled as a post processing service. But, if we integrate WSN positioning service with intelligent cameras, it is possible to differentiate the object stolen event from the authorized moving event in real time, thus reduce false alarm dramatically. And also it is possible to notify a nearest security guard to handle the event if it is decided not an authorized moving event. We developed a multi-modal surveillance system by integrating WSN, ZigBee positioning, audio and video event detection over cooperative sensor network to provide useful services. With the cooperation of different sensors, our system will keep our lives more secure by only signaling true event that needs to be handled.
A Scalable Security Framework for Reliable AmI Applications Based on Untrusted Sensors
Authors: José M. Moya, Juan Carlos Vallejo, Pedro Malagón, Álvaro Araujo, Juan-Mariano Goyeneche, Octavio Nieto-Taladriz
Venue: Proceedings of the 7th International Conference on Wired/Wireless Internet Communications (2009)

Security in Ambient Intelligence (AmI) poses too many challenges due to the inherently insecure nature of wireless sensor nodes. However, there are two characteristics of these environments that can be used effectively to prevent, detect, and confine attacks: redundancy and continuous adaptation. In this article we propose a global strategy and a system architecture to cope with security issues in AmI applications at different levels. Unlike in previous approaches, we assume an individual wireless node is vulnerable.We present an agent-based architecture with supporting services that is proven to be adequate to detect and confine common attacks. Decisions at different levels are supported by a trust-based framework with good and bad reputation feedback while maintaining resistance to bad-mouthing attacks. We also propose a set of services that can be used to handle identification, authentication, and authorization in intelligent ambients.The resulting approach takes into account practical issues, such as resource limitation, bandwidth optimization, and scalability.
An Ontology of Resources: Solving the Identity Crisis
Authors: Harry Halpin, Valentina Presutti
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for "real objects and imaginary concepts," as phrased by Berners-Lee. This distinction has often been tied to the distinction between information resources, like webpages and multimedia files, and non-information resources, which are everything from real people to abstract concepts like `the integers.' Furthermore, the W3C has recommended not to use the same URI for information resources and non-information resources, and several communities like the Linked Data initiative are deploying this principle. The definition put forward by the W3C, that non-information resources are things whose "essential nature is information" is a difficult distinction at best. For example, would the text of Moby Dick be an information resource? While this problem could safely be ignored up until recently, with the rise of Linked Data and projects like OKKAM, it appears that this problem should be modelled formally. An ontology called IRW (Identity and Reference on the Web) of various types of resources and their relationships, both for the hypertext Web and the Semantic Web, is presented. It builds upon Information Object Lite (an extension of DOLCE Ultra Lite for describing information objects) and IRE (an earlier ontology of and aligns with other work in this area. This ontology can be used as a tool to make the Semantic Web more self-describing and to allow inference to be used to test for membership in various classes of resources.
Approximation Algorithms for Reconstructing the&#x00a0;Duplication History of&#x00a0;Tandem&#x00a0;Repeats
Authors: Zhi-Zhong Chen, Lusheng Wang, Zhanyong Wang
Venue: Algorithmica (2009)

Computing the duplication history of a tandem repeated region is an important problem in computational biology (Fitch in Genetics 86:623&#x2013;644, 1977; Jaitly et al. in J. Comput. Syst. Sci. 65:494&#x2013;507, 2002; Tang et al. in J. Comput. Biol. 9:429&#x2013;446, 2002). In this paper, we design a polynomial-time approximation scheme (PTAS) for the case where the size of the duplication block is&#x00a0;1. Our PTAS is faster than the previously best PTAS in Jaitly et al. (J. Comput. Syst. Sci. 65:494&#x2013;507, 2002). For example, to achieve a ratio of 1.5, our PTAS takes O(n 5) time while the PTAS in Jaitly et al. (J. Comput. Syst. Sci. 65:494&#x2013;507, 2002) takes O(n 11) time. We also design a ratio-6 polynomial-time approximation algorithm for the case where the size of each duplication block is at most&#x00a0;2. This is the first polynomial-time approximation algorithm with a guaranteed ratio for this case.
Resource Allocation in Multiuser Multicarrier Wireless Systems, 1st edition
Authors: Ian C. Wong, Brian Evans
Venue:  (2007)

Many algorithms have already been proposed in the past to solve the problem of allocating resources in a multi-user multicarrier wireless system. Due to the difficulty of the problem, most of the previous work in this area has focused on developing suboptimal heuristics without performance guarantees. Resource Allocation in Multiuser Multicarrier Wireless Systems proposes a unified algorithmic framework based on dual optimization techniques that have complexities that are linear in the number of subcarriers and users, and that achieve negligible optimality gaps in standards-based numerical simulations. Adaptive algorithms based on stochastic approximation techniques are also proposed, which are shown to achieve similar performance with even much lower complexity. Key Features With theoretical derivations, practical algorithms, and complexity analysis this book makes an accessible reference for researchers and industry practioners alike All the algorithms proposed are clearly presented in concise block diagrams allowing the reader to implement these algorithms quite easily in the software of their choice The results of each section of the book are based on the 3GPP-LTE standard a fourth generation cellular standard of timely importance Presents chapter on the least complex algorithms that still achieve stochastically optimal results without the need for channel distribution information The section on future work presents several relevant avenues for further investigation of interest to researchers in the field
Protecting Privacy in Video Surveillance, 1st edition
Authors: Andrew Senior
Venue:  (2009)

Protecting Privacy in Video Surveillance offers the state of the art from leading researchers and experts in the field. This broad ranging volume discusses the topic from various technical points of view and also examines surveillance from a societal perspective. A comprehensive introduction carefully guides the reader through the collection of cutting-edge research and current thinking. The technical elements of the field feature topics from MERL blind vision, stealth vision and privacy by de-identifying face images, to using mobile communications to assert privacy from video surveillance, and using wearable computing devices for data collection in surveillance environments. Surveillance and society is approached with discussions of security versus privacy, the rise of surveillance, and focusing on social control. This rich array of the current research in the field will be an invaluable reference for researchers, as well as graduate students.
Multiple Classification Ripple Round Rules: A Preliminary Study
Authors: Ivan Bindoff, Tristan Ling, Byeong Ho Kang
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

This paper details a set of enhancements to the Multiple Classification Ripple Down Rules methodology which enable the expert to create rules based on the existing presence of a conclusion. A detailed description of the method and associated challenges are included as well as the results of a preliminary study which was undertaken with a dataset of pizza topping preferences. These results demonstrate that the method loses none of the appeal or capabilities of MCRDR and show that the enhancements can see practical and useful application even in this simple domain.
Plenary lecture IV: numerical and analytic investigation of some nonlinear problems in engineering sciences
Authors: Gabriella Bognar
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

In this talk we present theoretical and numerical results in connection with quasilinear partial and ordinary differential equations. The investigated nonlinear problems appear in the mathematical model of many problems in physics and mechanics. The qualitative and quantitative properties of solutions to quasilinear ordinary and partial differential equations are examined. To prove or disprove some of the conjectures require some massive numerical experiments which helps to visualize some important facts and helps to make appropriate decisions and to find optimal strategies.
De novo ligand evolution using bayesian optimization algorithms
Authors: Masaharu Munetomo, Kiyoshi Akama, Haruki Maeda
Venue: Proceedings of the 10th WSEAS international conference on evolutionary computing (2009)

Ligand optimization by computer simulation is becoming popular in drug design process to reduce cost of the chemical experiments. This paper presents a novel approach generating optimal ligand structures from scratch employing Bayesian optimization algorithm to realize an automated design of drug and other chemical structures. The proposed approach based on de novo ligand evolution optimizes structure of ligands by adding fragments to the base structure employing Bayesian optimization algorithm which is a promising approach in probabilistic model-building genetic algorithms. We show the effectiveness of our approach compared to the conventional approach using classical genetic algorithms.
An Implicit Method for Interpolating Two Digital Closed Curves on Parallel Planes
Authors: Nikolaos Gabrielides, Laurent Cohen
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Ardon et al. [2] presented an implicit method for surface segmentation in 3D images. The boundary of the surface is assumed to be constrained by two given curves in the image. In this work we adopt the afore approach to interpolate two given digital curves lying on parallel planes, by introducing an artificial image potential, which is based on a triangular facet surface interpolation technique.
Text Analysis for Requirements Engineering- Application of Computational Linguistics
Authors: Leonid Kof
Venue:  (2007)

Requirements Engineering is the Achilles heel of the whole software development process. It involves many stakeholders and includes not only technical but also sociological and psychological activities. Even when all the stakeholders come to a consensus, the produced requirements are rather informal. In the early project phases the functionality of the prospective software is not yet understood in the precision necessary for formalization, which makes requirements formalization not only a refinement, but also a learning process. To facilitate this learning process, this book proposes a novel approach to the extraction of a domain ontology from requirements documents in order to establish a common language for the project stakeholders. An ontology consists of a set of terms and relations between these terms. As compared to a glossary, a domain-specific ontology gives a more explicit definition of terms and relations between them. When the ontology is extracted, a domain expert validates it. The validated ontology becomes both the common language for all the project stakeholders and a valuable resource for later development steps. 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
Inequalities for Green's operator with Lipschitz and BMO norms
Authors: Yuming Xing, Shusen Ding
Venue: Computers Mathematics with Applications (2009)

In this paper, we obtain Lipschitz norm and BMO norm inequalities for Green's operator applied to differential forms. We also establish norm comparison theorems for the BMO norm and the Lipschitz norm of Green's operator.
Analyzing voice using Wavelet-Hilbert transform
Authors: Nooshin Nabizadeh, Ali Soleimani, Alireza Ahmadyfard
Venue: Proceedings of the 3rd WSEAS international symposium on Wavelets theory and applications in applied mathematics, signal processing & modern science (2009)

Time-frequency and time-scale transforms are one of the powerful mathematical methods for feature extraction of non-stationary signals such as voice. Modified Fourier-based transforms and Wavelet transforms are well-known among them. Voice can be analyzed by these influential methods but normally with some serious limitations and inadequacies. This paper proposes a new approach based on Wavelet-Hilbert Transform (WHT), for the analysis of voice signals. The mathematical model of a WHT is described. The obtained results by the proposed method show some advantages over the Fourier based algorithms.
The Role of ERP Implementation in Enabling Digital Options: A Theoretical and Empirical Analysis
Authors: Jahangir Karimi, Toni Somers, Anol Bhattacherjee
Venue: International Journal of Electronic Commerce (2009)

Many firms are transforming themselves from vertically integrated organizations into digitally enabled organizations. As firms become more innovative in their technical infrastructures and more competitive in their respective industries/verticals, their extended enterprise models include using their previous enterprise resource planning (ERP) investments as foundations for prioritizing additions and for longer-term strategies. The key issue for many firms is how to leverage their ERP implementation to become better partners and collaborators by enabling digital options to exploit business opportunities. This paper ascertains the contextual conditions under which ERP system implementations have the greatest impact on intention to adopt digital options. Using empirical data, it finds that the impact of ERP implementation on digital-options adoption intention is moderated by a firm's digital-resource readiness. For information systems (IS) practice, the study suggests that firms should view ERP divisibility as an option value generator for supporting new customers and revenue opportunities. For IS research, it relates digital-options theory to specific measurable constructs and to the firm's digital-resource readiness. Theoretical and practical implications are discussed.
Atom-bond connectivity index of trees
Authors: Boris Furtula, Ante Graovac, Damir Vukičević
Venue: Discrete Applied Mathematics (2009)

The recently introduced atom-bond connectivity (ABC) index has been applied up to now to study the stability of alkanes and the strain energy of cycloalkanes. Here, mathematical properties of the ABC index of trees are studied. Chemical trees with extremal ABC values are found. In addition, it has been proven that, among all trees, the star tree, S"n, has the maximal ABC value.
Using Context Annotated Mobility Profiles to Recruit Data Collectors in Participatory Sensing
Authors: Sasank Reddy, Katie Shilton, Jeff Burke, Deborah Estrin, Mark Hansen, Mani Srivastava
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

Mobile phones and accompanying network layers provide a platform to capture and share location, image, and acoustic data. This substrate enables participatory sensing: coordinated data gathering by individuals and communities to explore the world around them. Realizing such widespread and participatory sensing poses difficult challenges. In this paper, we discuss one particular challenge: creating a recruitment service to enable sensing organizers to select well-suited participants. Our approach concentrates on finding participants based on geographic and temporal coverage, as determined by context-annotated mobility profiles that model transportation mode, location, and time. We outline a three-stage recruitment framework designed to be parsimonious so as to limit risk to participants by reducing the location and context information revealed to the system. Finally, we illustrate the utility of the framework, along with corresponding modeling technique for mobility information, by analyzing data from a pilot mobility study consisting of ten users.
Letterplace ideals and non-commutative Gröbner bases
Authors: Roberto La Scala, Viktor Levandovskyy
Venue: Journal of Symbolic Computation (2009)

In this paper we propose a 1-to-1 correspondence between graded two-sided ideals of the free associative algebra and some class of ideals of the algebra of polynomials, whose variables are double-indexed commuting ones. We call these ideals the ''letterplace analogues'' of graded two-sided ideals. We study the behaviour of the generating sets of the ideals under this correspondence, and in particular that of the Grobner bases. In this way, we obtain a new method for computing non-commutative homogeneous Grobner bases via polynomials in commuting variables. Since the letterplace ideals are stable under the action of a monoid of endomorphisms of the polynomial algebra, the proposed algorithm results in an example of a Buchberger procedure ''reduced by symmetry''. Owing to the portability of our algorithm to any computer algebra system able to compute commutative Grobner bases, we present an experimental implementation of our method in Singular. By means of a representative set of examples, we show finally that our implementation is competitive with computer algebra systems that provide non-commutative Grobner bases from classical algorithms.
Evacuation Route Planning Algorithm: Longer Route Preferential
Authors: Maimai Zeng, Cheng Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Given a transportation network with capacity constraints, the initial occupancies and the destination nodes, evacuation route planning generates a set of evacuation routes and a schedule for the movement of people and vehicles along these routes, such that the evacuation is completed in the shortest possible time. This is a critical step in disaster emergency management and homeland defense preparation. In order to avoid the large storage and calculation costs brought by the time-expended-graph for transforming dynamic network flow problem to static network flow problem, the heuristic algorithm of the Capacity Constrained Route Planner (CCRP) is researched. One defect of the original CCRP algorithm is studied carefully and the new algorithm with longer route preferential is proposed to improve it. The result of the experiment shows the feasibility of the algorithm.
Processing intrusion detection alert aggregates with time series modeling
Authors: Jouni Viinikka, Hervé Debar, Ludovic Mé, Anssi Lehikoinen, Mika Tarvainen
Venue: Information Fusion (2009)

The main use of intrusion detection systems (IDS) is to detect attacks against information systems and networks. Normal use of the network and its functioning can also be monitored with an IDS. It can be used to control, for example, the use of management and signaling protocols, or the network traffic related to some less critical aspects of system policies. These complementary usages can generate large numbers of alerts, but still, in operational environment, the collection of such data may be mandated by the security policy. Processing this type of alerts presents a different problem than correlating alerts directly related to attacks or filtering incorrectly issued alerts. We aggregate individual alerts to alert flows, and then process the flows instead of individual alerts for two reasons. First, this is necessary to cope with the large quantity of alerts - a common problem among all alert correlation approaches. Second, individual alert's relevancy is often indeterminable, but irrelevant alerts and interesting phenomena can be identified at the flow level. This is the particularity of the alerts created by the complementary uses of IDSes. Flows consisting of alerts related to normal system behavior can contain strong regularities. We propose to model these regularities using non-stationary autoregressive models. Once modeled, the regularities can be filtered out to relieve the security operator from manual analysis of true, but low impact alerts. We present experimental results using these models to process voluminous alert flows from an operational network.
Cooperation Support in a Dyadic Supply Chain
Authors: François Galasso, Caroline Thierry
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

To improve the supply chains performance, taking into account the customer demand in the tactical planning process is essential. It is more and more difficult for the customers to insure a certain level of demand over a medium term period. Then it is necessary to develop methods and decision support systems to reconcile the order and book processes. In this context, this paper aims at introducing a collaboration support tool and methodology dedicated to a dyadic supply chain. This approach aims at evaluating in term of risks different demand management strategies within the supply chain using a simulation dedicated tool. The evaluation process is based on an exploitation of decision theory and game theory concepts and methods.