ppxscal/embedding_network huggingface dataset:
Two-Warehouse Fuzzy Expected Value Inventory Model
Authors: Li-hua Liu, Ling Zeng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper presents a fuzzy programming method to design two-warehouse inventory model in which the de- mand demand velocity and the time of goods's arrival are assume to be fuzzy parameter.We found fuzzy ex- pected value programming with the Liu's credibility theory for finding the optimal minimizing cost.Get the optimal order point and the minimizing cost from the hybrid intelligent algorithm provided that Fuzzy simu- lation,NN and GA. Finally give the example.
Filter theory of BL algebras
Authors: Michiro Kondo, Wies&#x0142;aw A. Dudek
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

In this paper we consider fundamental properties of some types of filters (Boolean, positive implicative, implicative and fantastic filters) of BL algebras defined in Haveshki et&#x00a0;al. (Soft Comput 10:657&#x2013;664, 2006) and Turunen (Arch Math Logic 40:467&#x2013;473, 2001). It is proved in Haveshki et&#x00a0;al. (2006) that if F is a maximal and (positive) implicative filter then it is a Boolean filter. In that paper there is an open problem Under what condition are Boolean filters positive implicative filters? One of our results gives an answer to the problem, that is, we need no more conditions. Moreover, we give simple characterizations of those filters by an identity form &#x2200; x, y(t(x, y) &#x2208; F), where t(x, y) is a term containing x, y.
Design of a high level language machine
Authors: G. J. Battarel, R. J. Chevance
Venue: ACM SIGARCH Computer Architecture News (1978)

This paper presents mechanisms to be realized on a basic, capability - based architecture, to support the execution of PL/1, COBOL and FORTRAN languages, while ensuring error confinement and facilitating error detection and categorization. The concept of domain is used in order to support various linking strategies. The addressing space of a task is structured according to three characteristics of its components: scope, lifetime and access rights. The semantics to be associated to data structures and data types are explored and a 3-address instruction set is proposed.
Analysis of EEG signals by combining eigenvector methods and multiclass support vector machines
Authors: Elif Derya íbeyli
Venue: Computers in Biology and Medicine (2008)

A new approach based on the implementation of multiclass support vector machine (SVM) with the error correcting output codes (ECOC) is presented for classification of electroencephalogram (EEG) signals. In practical applications of pattern recognition, there are often diverse features extracted from raw data which needs recognizing. Decision making was performed in two stages: feature extraction by eigenvector methods and classification using the classifiers trained on the extracted features. The aim of the study is classification of the EEG signals by the combination of eigenvector methods and multiclass SVM. The purpose is to determine an optimum classification scheme for this problem and also to infer clues about the extracted features. The present research demonstrated that the eigenvector methods are the features which well represent the EEG signals and the multiclass SVM trained on these features achieved high classification accuracies.
Database Skeleton and Its Application to Fuzzy Query Translation
Authors: Shi-Kuo Chang
Venue: IEEE Transactions on Software Engineering (1978)

This paper treats the problem of fuzzy query translation using the concept of database skeleton. An imprecise, or fuzzy, query is represented by a query graph, which can be analyzed for translatability with respect to a given database skeleton. The fuzzy query translation problem is formulated as a problem of converting a partially specified query graph into a completely specified query graph. This graph is then translated into a sequence of data manipulation commands, such as commands in relational algebra. Approaches to optimal fuzzy query translation are also described.
Learning Coordination in Multi-Agent Systems Using Influence Value Reinforcement Learning
Authors: Dennis Barrios-Aranibar, Luiz Marcos Garcia Goncalves
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper authors propose a new paradigm for learn- ing coordination in multi-agent systems. This approach is based on social interaction of people, specially in the fact that people communicate each other what they think about their actions and this opinion can influence the behavior of each other. It is proposed a model in which agents, into a multi-agent system, learns to coordinate actions giving opinions about actions of other agents and also being in- fluenced with opinions of other agents about their actions. This paradigm was used to develop a modified version of the Q-learning algorithm. This algorithm was tested and compared with independent learning (IL) and joint action learning (JAL) in two single state problems with two agents. This approach shows to have more probability to converge to an optimal equilibrium than IL and JAL Q-learning al- gorithms. Also, it does not need to make an entire model of all joint actions like JAL algorithms.
Special Feature an Implementation Guide to a Proposed Standard for Floating-Point Arithmetic
Authors: J. T. Coonen
Venue: Computer (1980)

This guide to an IEEE draft standard provides practical algorithms for floating-point arithmetic operations and suggests the hardware/software mix for handling exceptions.
Effective Checkpoint and Rollback Using Hardware/OS Collaboration
Authors: Portolan Michele, Leveugle Regis
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

We present a technique that achieves an effective and complete checkpoint and rollback by exploiting collaborations between the Operating System and the cache system in a microprocessor-based environment. That scheme allows overheads to be kept extremely low, while ensuring a great generality.
Proceedings 14th IEEE International Symposium on High Performance Distributed Computing - HPDC-14 [Title]
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The Web services resource framework defines conventions for managing state in distributed systems based on Web services, and WS-notification defines topic-based publish/subscribe mechanisms. We analyze five independent and quite different implementations of these specifications from the perspectives of architecture, functionality, standards compliance, performance, and interoperability. We identify both commonalities among the different systems (e.g., similar dispatching and SOAP processing mechanisms) and differences (e.g., security, programming models, and performance). Our results provide insights into effective implementation approaches. Our results may also provide application developers, system architects, and deployers with guidance in identifying the right implementation for their requirements and in determining how best to use that implementation and what to expect with regard to performance and interoperability. 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
Research on Mobile IP Routing of Space Network that Based on IP over CCSDS
Authors: Li-zheng Jiang, Xin Meng, Sheng-bo Hu, Shu-qian Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Space wideband information network technology is one of the hot technologies in studying of space technology, there are many difficult technologies need to be solved, for example, technologies of the connection and communication between space and ground heterogeneous network, algorithm of mobile routing, etc. The paper does research on these problems based on IP technology of the ground network and CCSDS protocol that special for space communication, proposes an approach for communication between space network and ground network using IP over CCSDS mode, then it designs a data transmission configuration and protocol stack model for the space/ground communication network, in the end, the paper analyses how to perform mobile IP routing in the network and also puts forward method for multiple constrained QoS analysis in mobile IP routing network. As a result, the research work will accelerate the integration of the space/ground network and promote the cross-supports of the international spaceflight missions.
Research on Ontology-based Representation and Retrieval of Components
Authors: Liu Quan, Jin Xinjuan, Long Yihong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Component-based development is an approach to developing a software system by assembling and composing already built software components. For component-based development to be successful, one of the key requirements is an effective scheme for classifying and describing them in detail, as well as a corresponding repository for storing and retrieving these components. This paper proposes an ontology-based software component description scheme with owl web ontology language. In this scheme, the component description information that is provided by user is associated with ontology to present semantic meaning, which builds the foundation for semantic reasoning in the component retrieval process. The semantic-based software component retrieval system is also constructed in this paper. This approach can retrieve component based on semantic description of the components. The whole approach extends the software reusable library to the World Wide Web. In the retrieval process, a user query in natural language is translated into web ontology language representation formats in order to augment retrieval recall and precision by deploying the same semantic representation technologies on both the user query side and the component side.
Workshop Report: Putting a Maturing Technology to Work
Authors: W. Rosenbluth
Venue: Computer (1978)

A cybernetic system model helped focus discussions of peripherals, development tools, debugging, and multiprocessing-all in relation to microprocessor applications.
An Extensible Meta-Model for Program Analysis
Authors: Dennis Strein, Rüdiger Lincke, Jonas Lundberg, Welf Löwe
Venue: IEEE Transactions on Software Engineering (2007)

Software maintenance tools for program analysisand refactoring rely on a meta-model capturing the relevantproperties of programs. However, what is considered relevantmay change when the tools are extended with new analyses andrefactorings, and new programming languages. This paper proposesa language independent meta-model and an architecture toconstruct instances thereof, which is extensible for new analyses,refactorings, and new front-ends of programming languages. Dueto the loose coupling between analysis-, refactoring-, and frontend-components, new components can be added independentlyand reuse existing ones. Two maintenance tools implementingthe meta-model and the architecture, VIZZANALYZER and XDEVELOP,serve as a proof of concept.
Agent-Based Transactions Management for Mobile Multidatabase
Authors: Machigar Ongtang, Ali R. Hurson, Yu Jiao, Thomas E. Potok
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The requirements to access and manipulate data across multiple heterogeneous existing databases and the proliferation of mobile technologies have propelled the development of mobile multidatabase system (MDBS). In that environment, transaction management is not a trivial task due to the technological constraints. This paper proposes an Agent-based Transaction Management for Mobile Multidatabase (AT3M) system. AT3M applies static and mobile agents to manage the transaction processing in mobile multidatabase system. It enables a fully distributed transaction management, accommodates mobility of the mobile clients, and allows global subtransactions to process in parallel. The proposed algorithm utilizes the hierarchical meta data structure of Summary Schema Model (SSM) which captures semantic information of data objects in the underlying local databases at different levels of abstractions. It is shown by simulation that AT3M suits well in mobile multidatabase environment and outperforms the existing V-Locking algorithm designed for the same environment in many aspects.
An Efficient Rank-based Image Transformation Scheme using Entropy Coding in Gray-Level Images
Authors: Eun-Choen Lim, Choon-Bo Shim, Kang Soo You
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In this paper, we propose a rank-based image transformation scheme which is a pre-processing method for enabling more efficient compression of gray-level images by entropy encoder. For this, before we do entropy encoding on a stream of gray-level values in an image, the proposed method counts co-occurrence frequencies for neighboring pixel values. Then, it replaces each gray value with particularly ordered numbers based on the co-occurrence frequencies. Finally, the ordered number are transmitted to an entropy encoder. The pre-processing step enhances the statistical characteristic of the image transformation and thus improves the performance of entropy coding considerably. The result from our simulation using 8 bits gray-scale images shows that the proposed method can reduce bit rate by up to 37.85% compared with existing plain entropy coders.
An analysis of generalization in the xcs classifier system
Authors: Pier Luca Lanzi
Venue: Evolutionary Computation (1999)

The XCS classifier system represents a major advance in learning classifier systems research because (1) it has a sound and accurate generalization mechanism, and (2) its learning mechanism is based on Q-learning, a recognized learning technique. In taking XCS beyond its very first environments and parameter settings, we show that, in certain difficult sequential (“animat”) environments, performance is poor. We suggest that this occurs because in the chosen environments, some conditions for proper functioning of the generalization mechanism do not hold, resulting in overly general classifiers that cause reduced performance. We hypothesize that one such condition is a lack of sufficiently wide exploration of the environment during learning. We show that if XCS is forced to explore its environment more completely, performance improves dramatically. We propose a technique, based on Sutton's Dyna concept, through which wider exploration would occur naturally. Separately, we demonstrate that the compactness of the representation evolved by XCS is limited by the number of instances of each generalization actually present in the environment. The paper shows that XCS's generalization mechanism is effective, but that the conditions under which it works must be clearly understood.
A General Discretization Scheme for the Design of IIR Fractional Filters
Authors: Ramiro S. Barbosa, J. A. Tenreiro Machado, Isabel S. Jesus
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper we present a general discretization scheme for digital fractional-order integrators and differentiators. The proposed scheme yields many of the widely classical s z conversion formulas. A least-squares method for the design of IIR fractional filters is proposed. The design of the recursive digital filter only requires the solution of linear equations. An illustrative example is presented showing the effectiveness of the resulting approximations.
ACKDs: An Authenticated Combinatorial Key Distribution Scheme for Wireless Sensor Networks
Authors: Linchun Li, Jianhua Li, Ling Tie, Jun Pan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In wireless sensor networks, sensor nodes generally cooperate with each other in collecting sensing data and in-network processing according to the group communication model. Key distribution is at the heart of secure group communications. In this paper, we present a scalable, efficient and authenticated scheme for group key distribution. The proposed scheme is based on a combinatorial exclusion basis system (EBS) for efficiency and one-way hash chains for authentication. It guarantees an authenticated group rekeying procedure and is efficient in terms of storage, communication and computation overheads.
On Interoperability and Conformance Assessment in Service Composition
Authors: Dick Quartel, Marten van Sinderen
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

The process of composing a service from other services typically involves multiple models. These models may represent the service from distinct perspectives, e.g., to model the different roles of systems involved in the service, and at distinct abstraction levels, e.g., to model the service's capability, interface or the orchestration that implements the service. The consistency among these models needs to be maintained in order to guarantee the correctness of the composition process. Two types of consistency relations are distinguished: interoperability, which concerns the ability of different roles to interoperate, and conformance, which concerns the correct implementation of an abstract model by a more concrete model. This paper discusses the need for and use of techniques to assess interoperability and conformance in a service composition process. The paper shows how these consistency relations can be described and analysed using concepts from the COSMO framework. Examples are presented to illustrate how interoperability and conformance can be assessed.
Fuzzy multicriteria decision making&mdash;an overview
Authors: Hsiao-Fan Wang
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this paper, we shall discuss how to make a satisfactory decision in imprecise and multicriteria situations. Following the conventional classification, we shall introduce multicriteria decision analysis with two categories of Fuzzy Multi-objective Decision Analysis in the first part and Fuzzy Multi-attribute Decision Analysis in the second part. Methodologies will be illustrated by application aspects.
A New Strategy for Code Generation the General-Purpose Optimizing Compiler
Authors: W. H. Harrison
Venue: IEEE Transactions on Software Engineering (1979)

This paper presents a systematic approach to the problem of generating good code with a compiler that is easy to construct. A compiler structure is proposed which relies on interprocedural data flow analysis, global optimization, and an intermediate language schema to simplify the task of writing the code generating portions of a compiler without sacrificing code quality. This structure is contrasted with a more conventional structure to explore the reasons why the new structure solves several problems inherent in the conventional structure. Further advantages which accrue from the new structure are also presented.
Ontology Exploration through Logical Views in Protégé
Authors: Alessio Bosca, Dario Bonino
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Ontology exploration or modelling becomes a challenging task when knowledge domains are huge and involve many relationships and restrictions. In such circumstances the ability to inspect and modify only specific parts of a given model may enable designers to achieve better results, by focusing on limited subsets of the domain. The work proposed in this paper extends a visualization plug-in for Protégé (Ontosphere3d) with so-called "Logical Views" in order to provide an explicit support for visualizing and modelling subsets of a given knowledge domain. We intend a logical view as a user-definable set of ontology entities (concepts and relations) having in common a so-called subject area. Once defined, logical views can be stored inside the ontologymodel in form of annotation properties; as a consequence the view definition is completely independent from the tool employed for its creation and can be easily ported to different platforms and development environments.
Text Classification Based on Nonlinear Dimensionality Reduction Techniques and Support Vector Machines
Authors: Lukui Shi, Jun Zhang, Enhai Liu, Pilian He
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Text classification is an important task in the field of natural language processing. The dimension of the text data is huge for the text documents are usually represented with the vector space model. Thus, it is greatly time-consuming to perform existed text categorization methods. Moreover, it is almost unimaginable to store and enquire high-dimensional text data. To improve the executing efficiency of classification methods, we present a classification algorithm based on nonlinear dimensionality reduction techniques and support vector machines. In the procedure, the ISOMAP algorithm is firstly executed to reduce the dimension of the high-dimensional text data. Then the low-dimensional data are classified with a multi-class classifier based single-class SVM. Experimental results demonstrate that the executing efficiency of categorization methods is greatly improved after decreasing the dimension of the text data without loss of the classification accuracy.
Reputation-aware Transaction Mechanisms in Grid Resource Market
Authors: Weina Lu, Shoubao Yang, Leitao Guo, Rui Zhang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In the grid resource market, there is a severe information asymmetry problem between the resource providers and the resource consumers. It leads to dishonest trades and results in the great loss of the resource consumers. We propose two mechanisms named reputation-aware aggregate mechanism and reputation-aware double auction mechanism to solve this problem: a resource provider's reputation value reflects the reliability of its resources; our mechanisms decide the trades between resource providers and consumers in terms of both reputation and price. The simulation results show that the reputation-aware aggregate mechanism and the reputation-aware double auction mechanism can both obviously decrease the loss of the resource consumers. The latter is more flexible and it reflects the traders' wish better than the former at the expense of slightly reducing the honest deal times. They are efficient methods to solve the information asymmetry problem.