ppxscal/embedding_network huggingface dataset:
samap: An user-oriented adaptive system for planning tourist visits
Authors: Luis Castillo, Eva Armengol, Eva Onaindía, Laura Sebastiá, Jesús González-Boticario, Antonio Rodríguez, Susana Fernández, Juan D. Arias, Daniel Borrajo
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper, we present samap, whose goal is to build a software tool to help different people visit different cities. This tool integrates modules that dynamically capture user models, determine lists of activities that can provide more utility to a user given the past experience of the system with similar users, and generates plans that can be executed by the user. This system is intended to work in portable devices (mobile phones, PDAs, etc.,) with internet connection. In this paper, we describe the architecture, the knowledge model that is shared among components using an ontology, and the three components of the tool: user module, case-based module and planning module.
A New Optimization Engine for the LSF Vector Quantization
Authors: Jian Tang, Jingsong He, Lu Huang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The speech signal line spectral frequencies (LSF) vector quantization is one of the most important issues in speech coding systems, while the codebook design is the key problem, which impacts the synthesis speech quality severely. A new optimization mechanism named vector space scale-stretching (VSSS) was presented in this paper. By introducing nearest neighbor partition (NNP) control factor based on the scale-stretching technique, the codebook centroid track was optimized in a comparatively low dimension space. The new optimization mechanism reduced the search space of evolutionary computation and made the evolutionary operation more maneuverable. The experiments show that the VSSS is effective, and the new codebook design algorithms are robust.
Knight move in chromatic cohomology
Authors: Michael Chmutov, Sergei Chmutov, Yongwu Rong
Venue: European Journal of Combinatorics (2008)

In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. Helme-Guizon and Y. Rong. Namely, for a connected graph @C with n vertices the only non-trivial cohomology groups H^i^,^n^-^i(@C),H^i^,^n^-^i^-^1(@C) come in isomorphic pairs: H^i^,^n^-^i(@C)@?H^i^+^1^,^n^-^i^-^2(@C) for i>=0 if @C is non-bipartite, and for i>0 if @C is bipartite. As a corollary, the ranks of the cohomology groups are determined by the chromatic polynomial. At the end, we give an explicit formula for the Poincare polynomial in terms of the chromatic polynomial and a deletion-contraction formula for the Poincare polynomial.
Extended abstract: a formal design approach from software oriented UML descriptions to hardware oriented RTL
Authors: M. Fujita
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

In this paper we discuss UML based hardware design approaches that can effectively and efficiently use formal verification methods to analyze and verify designs. We discuss techniques on how to use UML based design analysis for generating reduced models that are used in formal verification. This process typically starts with pure functional analysis of the design targets and then gradually converts them to more structural ones so that the final ones can be considered as register transfer level (RTL) designs. We show how UML diagrams can be used to come up with reduced models that can be used for assume-guarantee reasoning and compositional reasoning. We use a real chip design process as an example and discuss about our design and verification methodology.
Microsystems Public Access to Personal Computing: A New Role for Science Museums
Authors: R. A. Kahn
Venue: Computer (1977)

From an educational standpoint, science museums and computers have shared a common characteristic: both have tended to be static and passive, offering little opportunity for participation in or access to technology. A museum visit, always a culturally respectable way to spend a Saturday afternoon, generally involves a lot of walking, looking, and listening, but little touching or participating. Likewise, public access to computers has generally been vicarious, or limited to computer output only. We watch the airline ticket agent make a reservation at the terminal, we receive computer-generated form letters and bills in the mail, and we peer through the glass portal at the computerized San Francisco Bay Area Rapid Transit Control Room. 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
Formal Verification of Business Workflows and Role Based Access Control Systems
Authors: Arnaud Dury, Sergiy Boroday, Alexandre Petrenko, Volkmar Lotz
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

An approach for combined modeling of role-based access control systems (RBAC) together with business workflows is presented. The model allows to model check various security properties. Several techniques to confine the state explosion, which may occur during model checking are presented and experimentally evaluated using the model checker Spin. The techniques allow the verification of the business workflow and associated RBAC for a reasonable number of users of a medium sized company.
B72-10 PL/I Programming In Technological Applications
Authors: E. H. Remy
Venue: IEEE Transactions on Computers (1972)

It is unusual these days to find a product that does more than expected. Mr. Groner's book not only covers an appropriate subset of the PL/I language, but also imparts much wisdom from the field of scientific computing. It does much to bridge the wide gap between the functional understanding of a computer language and the skill necessary to effectively use it in solving problems. The reader is assumed to be knowledgeable in engineering or the sciencies, but a beginner to computer programming. 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
Adptable Architectures for Supersystems
Authors: C. R. Vick
Venue: Computer (1980)

New adaptation properties for supersystem architectures will allow higher throughputs from the same hardware, lengthening system life cycles.
Fault isolation for nonlinear dynamic systems based on parameter intervals
Authors: Zetao Li, Boutaieb Dahhou
Venue: International Journal of Systems Science (2007)

The study of fault detection and isolation for nonlinear dynamic systems has been receiving significant attention. Up to now few literatures pay attention to the speed of fault isolation. However, it is a crucial problem for the design of the fault-tolerant control (FTC) of the nonlinear dynamic systems. In this article a new method of fault isolation for nonlinear dynamic systems is proposed. The method is based on the monotonous characteristic of the prediction error of the observer with respect to singular parameter difference between the system and the observer. The proposed method has the advantage of the methods based on adaptive observers that fits a large kind of nonlinear dynamic systems, while it does not have their disadvantage that take a long time to identify the system parameter: Therefore the fault isolation of this method is quicker. The performance of the method is illustrated by simulation results using a nonlinear dynamic model of an alcoholic fermentation process.
New Applications & Recent Research
Authors: D. A. Michalopoulos
Venue: Computer (1978)

Scientists at Bell Telephone Laboratories have achieved a potentially significant advance in solid-state technology by doubling the speed at which electrons can move through semiconductor crystals at room temperature.
An exact primal---dual penalty method approach to warmstarting interior-point methods for linear programming
Authors: Hande Y. Benson, David F. Shanno
Venue: Computational Optimization and Applications (2007)

One perceived deficiency of interior-point methods in comparison to active set methods is their inability to efficiently re-optimize by solving closely related problems after a warmstart. In this paper, we investigate the use of a primal---dual penalty approach to overcome this problem. We prove exactness and convergence and show encouraging numerical results on a set of linear and mixed integer programming problems.
Constructing optimal fuzzy models using statistical information criteria
Authors: John Yen, Liang Wang
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

Theoretical studies have shown that fuzzy models are capable of approximating any continuous function on a compact domain to any degree of accuracy. However, good performance in approximation does not necessarily assure good performance in prediction or control. A fuzzy model with a large number of fuzzy rules may have a low accuracy of estimation for the unknown parameters. This is especially true when only limited sample data are available in building the model. Further, such a model often encounters the risk of overfitting the data and thus has a poor ability of generalization. A trade-off is thus required in building a fuzzy model: on the one hand, the number of fuzzy rules must be sufficient to provide the discriminating capability required for the given application; on the other hand, the number of fuzzy rules must be parsimonious to guarantee a reasonable accuracy of parameter estimation and a good ability of generalizing to unknown patterns. In this paper we apply statistical information criteria for achieving such a trade-off. In particular, we combine these criteria with an SVD (singular value decomposition) based fuzzy rule selection method to choose the optimal number of fuzzy rules and construct the best fuzzy model. The role of these criteria in fuzzy modeling is discussed and their practical applicability is illustrated using a nonlinear system modeling example.
The Oregon Report Computing in the 1980's
Authors: T. Lewis
Venue: Computer (1978)

In January 1976 we first discussed the need for a meeting that would stimulate innovative and creative approaches to existing and future problems in computing. The general requirements of such a workshop (or what we call a "report") were to bring together leading experts in several overlapping disciplines of computing in a meeting format conducive to producing in-depth analysis of problems being created for the 1980's by the events of the late 1970's. The meeting, held in Portland in March of this year, took a form dictated by the needs of the participants. To encourage creative interaction, we provided the working groups with long hours of close contact, and some groups met in heated debate late into the evening. We wanted the report to withstand the fire of criticism, so the meeting included observers: both invited technical observers and a limited number of public participants. We invited two trained analysts as critics, and planned for a small public attendance of no more than 100 people. The papers that were presented at the meeting are available from IEEE as a full-length proceedings.
Multi-agent systems applied to virtual environments: a case study
Authors: A. Barella, C. Carrascosa, V. Botti, M. Martí
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Computer game development covers many different areas, such as graphics, artificial intelligence (AI) and network communications. Nowadays, players demand more sophisticated and credible computer-controlled opponents, but results are sometimes unsatisfactory. This is due to the need of real-time processing constraints to reach an acceptable feeling of immersion for the user. The development of systems, tools and development environments can play an important role in the progress of this field. The combination of AI techniques and virtual reality (or virtual environments) has given birth to the field of intelligent virtual environments (IVEs). An IVE is a virtual environment simulating a physical (or real) world, inhabited by autonomous intelligent entities [Luck and Aylett 2000]. These entities have to interact in / with the virtual environment as if they were real entities in the real world. There are some other typical problems of an IVE that we have to solve, as explained in [Bierbaum et al. 2001]: independence of the underlying technologies, user interactions (not only displaying images, but using specific devices such as trackers, gloves), synchronization of both data and image (even in case of multiple displays).
A Formal Approach to prevent Attacks on Mobile Agent Systems
Authors: Monia Loulou, Mohamed Tounsi, Ahmed Hadj Kacem, Mohamed Jmaiel, Mohamed Mosbah
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

One of the most important issues in mobile agent systems is the security aspect. For the purpose of ensuring security, we provide in this paper a formal model for secure mobile agent system. This model supports the specification of numerous security policy types which control the behaviour of system entities and protect them, as far as possible, from attacks that may occur. In order to verify whether a security policy could overcome a given kind of attack, we present a formal approach to this end. Thus, we propose a precise and formal representation of possible attacks that may occur in a mobile agent systems. According to this representation, we define a set of proved theorems which describe under what conditions a policy succeeds to prevent those attacks. The proposed specifications have been formalized using Z notation and checked using the Z-EVES tool.
High-Accuracy Architecture-Level Power Estimation for Partitioned SRAM Arrays in a 65-nm CMOS BPTM Process
Authors: Minh Q. Do, Per Per Larsson-Edefors, Mindaugas Dra!zd!ziulis
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper, we validate our previously proposed highlevel power estimation models for a 65-nm BPTM process, using a physically partitioned 2-kB 6T-SRAM array. Also, we describe a new probing methodology that allows us to accurately capture not only subthreshold leakage, but also all other significant leakage mechanisms. By combining the probing methodology and the power models, we can estimate dynamic, leakage and total power of the partitioned 2-kB memory array with a 97% accuracy of that of full circuit-level simulations of the entire array. We also discuss the effect of partitioning on SRAM array power with respect to process technology scaling: Partitioning has the effect that leakage power constitutes an increasing fraction of total memory power, emphasizing the need to accurately capture leakage power in SRAM power models.
k-lp-Lipschitz t-norms
Authors: A. Mesiarová
Venue: International Journal of Approximate Reasoning (2007)

k-l"p-Lipschitz t-norms are shown to be ordinal sums of k-l"p-Lipschitz Archimedean t-norms. Additive generators of k-l"p-Lipschitz t-norms are characterized by means of k-p-convexity. Several necessary and sufficient conditions for a function to be a k-p-convex additive generator are also given.
A 6LoWPAN application environment
Authors: Gilman Tolle
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

We are demonstrating a networking technology and application environment that connects highly-constrained low-power wireless embedded sensor networks with large-scale IP networks. This technology is based on the 6LoWPAN IPv6-over-802.15.4 adptation layer.
ASN1-light: A Verified Message Encoding for Security Protocols
Authors: Holger Grandy, Robert Bertossi, Kurt Stenzel, Wolfgang Reif
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

There is a mismatch between the data format used in im- plementations of security protocols and the data types used in formal verification of security protocols. We present a verified encoding scheme for data used in security proto- cols, which links the abstract data types of the formal world to a byte format usable in implementations. The encoding is inspired by the ASN1 encoding scheme. The encoding is implemented in Java and the implementation is proven to be correct against a formal specification. The implementa- tion can be used as a reusable reference library in security protocol implementations. The benefit is a separation of concerns: The protocol can be verified on an abstract level. The mapping to bytes is automatically correct by linking the library. Additionally the encoding is a challenging Java verification case study in its own.
An interactive possibilistic programming approach for multiple objective supply chain master planning
Authors: S. A. Torabi, E. Hassini
Venue: Fuzzy Sets and Systems (2008)

Providing an efficient production plan that integrates the procurement and distribution plans into a unified framework is critical to achieving competitive advantage. In this paper, we consider a supply chain master planning model consisting of multiple suppliers, one manufacturer and multiple distribution centers. We first propose a new multi-objective possibilistic mixed integer linear programming model (MOPMILP) for integrating procurement, production and distribution planning considering various conflicting objectives simultaneously as well as the imprecise nature of some critical parameters such as market demands, cost/time coefficients and capacity levels. Then, after applying appropriate strategies for converting this possibilistic model into an auxiliary crisp multi-objective linear model (MOLP), we propose a novel interactive fuzzy approach to solve this MOLP and finding a preferred compromise solution. The proposed model and solution method are validated through numerical tests. Computational results indicate that the proposed fuzzy method outperforms other fuzzy approaches and is very promising not only for solving our problem, but also for any MOLP model especially multi-objective mixed integer models.
Intelligent Water Dispersal Controller: Comparison between Mamdani and Sugeno Approaches
Authors: Marina Yusoff, Sofianita Mutalib, Shuzlina Abdul Rahman, Azlinah Mohamed
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This paper presents a comparison of fuzzy inference methods in intelligent water dispersal controller primarily focuses on grass watering. In irrigation system, measuring and monitoring soil moisture from the soil information and climatologic factors would determine the amount of water for sufficient soil moisture. Mamdani-style and Sugenostyle inference methods have been tested and evaluated using this information. These methods were tested on normal subsets. Fuzzy rules were determined based on three inputs namely; Bermuda Turf grass coefficient, evapotranspiration (ET) rate, and tensiometer data. The result illustrated that the most convincing fuzzy inference method applied was the Mamdani-style compared to Sugeno-style. It was shown that the controller used less water in turf grass irrigation. Overall, both of the tested methods give significant result to the recognition of soil moisture level.
Bayes estimators for reliability measures in geometric distribution model using masked system life test data
Authors: Ammar M. Sarhan, Debasis Kundu
Venue: Computational Statistics Data Analysis (2008)

This paper presents Bayes estimators for the reliability measures of the individual components in a multi-component systems in the presence of masked system life test data. The life time distributions of the system components are assumed to be geometric with different parameters. Two-sided Bayesian probability intervals of the parameters are also derived. Numerical simulation study is given in order to: (i) explain how one can apply the theoretical results obtained, (ii) study the influence of the sample size and masking level on the accuracy of point estimates.
Hybrid Application On Job-Shop Scheduling by Genetic Algorithm and MAS Spring-Net
Authors: Dong Yumin, Xiao Shufen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

To solve Job-Shop production scheduling problem, we presented a new hybrid optimum arithmetic of using genetic algorithm and MAS(Multi-Agent System) composite-spring-net. Introduced the structure and model of genetic algorithm, illuminated the basic principle of spring-net arithmetic. By the experiment proving, the hybrid application of GA and sping-net arithmetic can make favorable effect on solving the problems of job-shop schedule.
A Novel Fully Evolved Kernel Method for Feature Computation from Multisensor Signal Using Evolutionary Algorithms
Authors: Kuncup Iswandy, Andreas Koenig
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The design of intelligent sensor systems requires sophisticated methods from conventional signal processing and computational intelligence. Currently, a significant part of the overall system architecture still has to be manually elaborated in a tedious and time consuming process by an experienced designer for each new application or modification. Clearly, an automatic method for auto-configuration of sensor systems would be salient. In this paper, we contribute to the optimization of the feature computation step in the overall system design, investigating Gaussian kernel methods. Our goal is to improve the kernel method of feature computation with consideration on including the adjustable magnitude parameter for Gaussian kernels or fully evolved Gaussian kernels, which are inspired by feature weighting concepts and are similar to RBF like neural network with correlation based kernel layer and linear combiner output layer. We compare this improved method with previous kernel methods using weighting method of multiobjective evolutionary optimization, i.e., genetic algorithms. In addition to the straightforward feature space from the optimized kernel layer, we complement the kernel layer by linear combiner layer, with weights computed by traditional LDA (linear discriminant analysis) in the loop of the optimization. In our experiments, we applied gas sensor benchmark data and the results showed that our novel method can achieve competitive or even better recognition accuracies and effectively reduce the computational complexity as well.
A Heuristic Approach for Target SNP Mining Based on Genome-Wide IBD Profile
Authors: Fan Zhang, Xia Li, Ivan Viktorovich Krivosheev, Binsheng Gong, Lei Du, Chunquan Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The progress in detecting single nucleotide polymorphisms (SNPs) genome-wide provides the opportunities to investigate responsible loci for multigenic human disorders, simultaneously proposes the urgent need to establish the technology for large-scale analysis of SNPs. In this study, a heuristic approach is proposed to mine SNP markers responsible for disease. Firstly, a feature selection algorithm is advanced accounting for both joint and marginal effects. Secondly, we iterate the algorithm to identify plentiful subsets of SNP markers which have potential to discriminate between affected sib-pairs with disease and unaffected controls based on the proportion of alleles identical by descent (IBD) at the SNP locus, for sibling pairs. Those markers that are returned most often from many subsets sampled are considered "important". We have applied the approach to the Genetic Analysis Workshop 14 COGA data and some intriguing results emerge.