ppxscal/embedding_network huggingface dataset:
A fuzzy programming approach for a cell formation problem with dynamic and uncertain conditions
Authors: Nima Safaei, Mohammad Saidi-Mehrabad, Reza Tavakkoli-Moghaddam, Farrokh Sassani
Venue: Fuzzy Sets and Systems (2008)

This paper presents an integration of explicit uncertainty for a cell formation problem (CFP) with a dynamic condition in cellular manufacturing systems (CMS). The dynamic condition indicates a multi-period planning horizon, in which product mix and demand in each period are different. As a result, the best cells designed for one period may not be the most efficient for subsequent periods and thus require reconfigurations. Moreover, in real manufacturing systems, some input parameters are fuzzy in nature. In such cases, the fluctuation in part demand and the availability of manufacturing facilities in each period can also be regarded as fuzzy. In this paper, a fuzzy programming-based approach is developed to solve an extended mixed-integer programming model of the dynamic CFP, in which there are piecewise fuzzy numbers as coefficients in the objective function and the technological matrix. The main purpose of this paper is to determine the optimal cell configuration in each period with the maximum degree of satisfying the fuzzy objective under the given constraints. To illustrate the behavior of the proposed model and verify the performance of the developed fuzzy programming-based approach, we introduce a number of numerical examples to illustrate the use of the foregoing approach. Finally, the related computational results are reported and discussed.
Sequential Machines with Less Delay Elements than Feedback Paths
Authors: G. B. Gerace, G. Gestri
Venue: IEEE Transactions on Computers (1969)

In this paper the possibility of removing in synchronous sequential machines some of the delay elements which store the internal state is discussed. Theorems and methods are given for eliminating all removable delay elements from a given realization of a synchronous machine and for selecting the assignments leading to a realization which requires the least number of delay elements. It is shown how the existence of these assignments is related to the existence of a pair of partitions on the set of states of the given machine. The internal performance of the sequential networks in which at least one but not all delay elements are removed is studied, and a "hybrid operating mode" is defined. A reclassification of sequential machines in terms of the algebraic structure of machines which relates to the number of removable delay elements is proposed. Sequential machines are, therefore, divided in three categories: synchronous, hybrid, and asynchronous, and some problems of decomposition for the three types of machines are discussed.
Coal Thickness Prediction Based on Support Vector Machine Regression
Authors: Li Zhengwei, Xia Shixiong, Niu Qiang, Xia Zhanguo
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A novel method based on support vector machine for coal thickness prediction through seismic attribute technology is proposed in this paper. Based on SVM which embodies the Structural Risk Minimization principle, the proposed method is more generalized in performance and accurate than artificial neural network which embodies the Embodies Risk Minimization principle. In order to improve prediction accuracy, grid search and cross-validation are integrated in this paper to select SVM parameter. Error analysis of predicting coal thickness is carried out to prove that SVM could achieve greater accuracy than the BP neural network.
Detecting Compromised Nodes in Wireless Sensor Networks
Authors: Mary Mathews, Min Song, Sachin Shetty, Rick McKenzie
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

While wireless sensor networks are proving to be a versatile tool, many of the applications in which they are implemented have sensitive data. In other words, security is crucial in many of these applications. Once a sensor node has been compromised, the security of the network degrades quickly if there are not measures taken to deal with this event. There have been many approaches researched to tackle the issue. In this paper, we look into an anomaly-based intrusion detection system to detect compromised nodes in wireless sensor networks. An algorithm to detect the compromised sensor nodes has been developed. Simulations are conducted to verify the design.
Combined static and dynamic mutability analysis
Authors: Shay Artzi, Adam Kiezun, David Glasser, Michael D. Ernst
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Knowing which method parameters may be mutated during a method's executionis useful for many software engineering tasks. We present an approach todiscovering parameter reference immutability, in which several lightweight, scalable analyses are combined in stages, with each stage refining the overall result. The resulting analysis is scalable and combines the strengths of its component analyses. As one of the component analyses, we present a novel, dynamic mutability analysis and show how its results can be improved by random input generation. Experimental results on programs of up to 185 kLOC show that, compared to previous approaches, our approach increases both scalability and overall accuracy
Temporal and spatial features of single-trial EEG for brain-computer interface
Authors: Qibin Zhao, Liqing Zhang
Venue: Computational Intelligence and Neuroscience (2007)

Brain-computer interface (BCI) systems create a novel communication channel from the brain to an output device bypassing conventional motor output pathways of nerves and muscles. Modern BCI technology is essentially based on techniques for the classification of single-trial brain signals. With respect to the topographic patterns of brain rhythm modulations, the common spatial patterns (CSPs) algorithm has been proven to be very useful to produce subject-specific and discriminative spatial filters; but it didn't consider temporal structures of event-related potentials which may be very important for single-trial EEG classification. In this paper, we propose a new framework of feature extraction for classification of hand movement imagery EEG. Computer simulations on real experimental data indicate that independent residual analysis (IRA) method can provide efficient temporal features. Combining IRA features with the CSP method, we obtain the optimal spatial and temporal features with which we achieve the best classification rate. The high classification rate indicates that the proposed method is promising for an EEG-based brain-computer interface.
Research on Advanced Assembly Automation
Authors: J. L. Nevins
Venue: Computer (1977)

The advancement and application of any manufacturing technique require two research issues to be resolved. First, the technique must be understood. That is, there must exist mathematical models of the technique's performance which have been experimentally verified. Second, the relation between the technique and other manufacturing processes with which it will work must be understood so that the new technique can be integrated with the rest of the factory. As these steps are accomplished for more processes, integrated factories of a new kind will emerge.
A Modeling Framework for the Development of Provably Secure E-Commerce Applications
Authors: Nina Moebius, Dominik Haneberg, Wolfgang Reif, Gerhard Schellhorn
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Developing security-critical applications is very difficult and the past has shown that many applications turned out to be erroneous after years of usage. For this reason it is desirable to have a sound methodology for developing security-critical E-Commerce applications. We present an approach to model these applications with the unified modeling language (UML) [1] extended by a UML profile to tailor our models to security applications. Our intent is to (semi-) automatically generate a formal specification suitable for verification as well as an implementation from the model. Therefore we offer a development method seamlessly integrating semi-formal and formal methods as well as the implementation. This is a significant advantage compared to other approaches not dealing with all aspects from abstract models down to code. Based on this approach we can prove security properties on the abstract protocol level as well as the correctness of the protocol implementation in Java with respect to the formal model using the refinement approach. In this paper we concentrate on the modeling with UML and some details regarding the transformation of this model into the formal specification. We illustrate our approach on an electronic payment system called Mondex [10]. Mondex has become famous for being the target of the first ITSEC evaluation of the highest level E6 which requires formal specification and verification.
Medical Image Segmentation by Geodesic Active Contour Incorporating Region Statistical Information
Authors: Changzheng Liu, Junlin Ma, Guiyun Ye
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Geodesic active contour methods are powerful numerical techniques for image segmentation and analysis. However the edge detector in the model ensures that the data on both sides of the contour is as dissimilar as possible, it cannot deal with the requirement that also the interior of a region should be as homogeneous as possible. In this paper, we present a new region based geodesic active contour method. The new method gives a global view of the boundary information within the image. The method here proposed is particularly well adapted to situations where edges are weak and overlap, and the curve initialization is a very bad guess. A number of experiments on CT medical images were performed to evaluate the new method. The experimental results demonstrate the reliability and efficiency of this new method.
A System Architecture for Monitoring Sensor Data Stream
Authors: Yang Koo Lee, Ling Wang, Keun Ho Ryu
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

A wireless sensor network consists of many sensors that collect and transmit physical or environmental conditions at different locations to a server continuously. Many researches mainly focus on processing continuous queries on real-time data stream. However, they do not concern the problem of storing the historical data, which is mandatory to the historical queries. In this paper, we propose a system architecture for handling and storing sensor data stream in real-time to support the spatial and/or temporal queries besides continuous queries. We exploit a segment-based method to store the sensor data stream and reduce the managed tuples without any loss of information, which lead to the improvement of the accuracy of query results. In addition, we offer a method to reduce the cost of join operations in processing spatiotemporal queries by filtering out the list of irrelevant sensors from the query range before making the join operation. We then present a design of the system architecture for processing spatial and/or temporal queries. Finally, we implement a climate monitoring application system based on our proposed system architecture.
MARS: A Multiprocessor-Based Programmable Accelerator
Authors: P. Agrawal, W. J. Dally, W. C. Fischer, H. V. Jagadish, A. S. Krishnakumar, R. Tutundjian
Venue: IEEE Design Test (1987)

MARS, short for microprogrammable accelerator for rapid simulations, is a multiprocessor-based hardware accelerator that canefficiently implement a wide range of computationally complex algorithms. In addition to accelerating many graph-related problemsolutions, MARS is ideally suited for performing event-driven simulations of VLSI circuits. Its highly pipelined and parallelarchitecture yields a performance comparable to that of existing special-purpose hardware simulators. MARS has the added advantageof flexibility because its VLSI processors are custom-designed to be microprogrammable and reconfigurable. When programmedas a logic simulator, MARS should be able to achieve 1 million gate evaluations per second.
A Fault Resilient Routing Protocol for Mobile Ad-Hoc Networks
Authors: Sirisha Medidi, Jiong Wang
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

devices cooperate to forward packets for each other without the assistance of dedicated routing infrastructures. Due to its net- working flexibility and node mobility, MANET routing presents a new set of nontrivial challenges such as broadcast overhead, frequent topology changes, and slow convergence. Additionally, many proposed MANET routing protocols assume a friendly and cooperative environment, and hence are vulnerable to various attacks by misbehaving nodes. Recently, significant attention has been devoted to developing the fault resilient routing protocol for MANET, which requires routing stability and scalability in hostile and demanding environments. In this paper, we propose a fault resilient ad hoc routing protocol called Local Self-recovery Routing (LSR), that is geared to adapt to topology dynamics and selfish behaviors in the shortest possible time. During the route recovery, the shortest detour is found to repair the faulty links locally using a cone-shaped recovery zone, and the broadcast area is efficiently chosen to minimize overhead while achieving a good recovery rate. Our ns-2 based simulation shows significant performance enhancements of LSR in throughput and routing overhead. Also, based on the simulation, the optimal angle of a cone-shaped recovery zone is studied under various scenarios. Key words: Mobile Ad-hoc Networks, Route Maintenance, Fault Resiliency
Distributed Key Establishment Scheme in Wireless Sensor Network
Authors: Zhao Hong-Wei, Pei Shi-Hui, Liu Ping-Ping
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Overhead imbalance of sensor nodes make it infeasible to use traditional key distribution center scheme for security service of distributed sensor network. In this paper we propose a distributed key establishment scheme. In the phase of key pre-distribution, every sensor node is preloaded the same size key pre-distribution information; in the phase of key establishment, the overhead every sensor node used to distribute key is the same. So, the overhead imbalance problem of traditional key distribution center scheme can be solved. A distinguishing property of this framework is that it does not require the knowledge of sensor's expected location and greatly simplifies the deployment of sensor networks. In security, the relationship between the ratio of compromised links to non-compromised sensors and the number of compromised nodes is linear.
A 10Gbps/channel On-Chip Signaling Circuit with an Impedance-Unmatched CML Driver in 90nm CMOS Technology
Authors: T. Kuboki, A. Tsuchiya, H. Onodera
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

An on-chip signaling system consists of a CML driver, a differential transmission-line and a CML receiver is fabricated. We developed an impedance-unmatched driver for power reduction. The impedance-unmatched driver reduces the tail current of the CML buffer by tuning the load resistance. The designed circuit achieves 3mm, 10Gbps/channel on-chip signal transmission and the impedance-unmatched driver saves the energy per bit by 21% compared with a conventional impedance-matched driver.
A new binarization algorithm based on maximum gradient of histogram
Authors: Jia Huading, Luo Binjie, Wang Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper studies several binarization algorithms in Chinese cheque recognition preprocessing. After analyzing the histograms of gray images of 2000 cheques, we found a clue, which can be used for segmenting image. With the clue, we developed a new binarization algorithm based on the maximum gradient of the histogram, making the target object stand out in the binary image. Comparing several other commonly used binarization algorithms, the algorithm proposed by the paper has been proven in the simulating tests to be more feasible and advanced.
Artificial Immunity-Based Feature Extraction for Spam Detection
Authors: Burim Sirisanyalak, Ohm Sornil
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Spam is considered a significant security problem for computer users everywhere. Spammers exploit a variety of tricks to conceal parts of messages that can be used to identify spam. This paper presents an email feature extraction technique based on artificial immune systems. The method extracts a relatively small set of features that can be used as inputs to a classification model. A Backpropagation neural network is employed as the spam detection model. The performance evaluation against a standard spam collection and reference systems shows that the proposed approach performs well compared to other systems with large sets of features, rules, or external evidences. The detection rate of the best system in the study is 92.4%, with 1% and 13.8% of false positive and false negative rates, respectively.
A Jacobi-Davidson type method for the product eigenvalue problem
Authors: Michiel E. Hochstenbach
Venue: Journal of Computational and Applied Mathematics (2008)

We propose a Jacobi-Davidson type method to compute selected eigenpairs of the product eigenvalue problem A"m...A"1x=@lx, where the matrices may be large and sparse. To avoid difficulties caused by a high condition number of the product matrix, we split up the action of the product matrix and work with several search spaces. We generalize the Jacobi-Davidson correction equation and the harmonic and refined extraction for the product eigenvalue problem. Numerical experiments indicate that the method can be used to compute eigenvalues of product matrices with extremely high condition numbers.
The Research of Local Area Storage Grid System
Authors: Peihe Tang, Hao Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this project the research of local area storage resource efficiency sharing and design of an applied local area storage grid system were presented. Its architecture, metadata management, storage resource allocation rule, file transfer service were discussed in detail. According to needs, basic functions of system are analyzed for the first step, and then realization of middleware of system structure is studied. This text deeply discusses main functions and realization of grid server, including management of metadata, distribution strategy of storage source, file transfer etc.
On the relation between two approaches to combining evidence: Ordered Abelian Groups and uninorms
Authors: Ronald R. Yager, Vladik Kreinovich
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

In this paper, we develop a relationship between two approaches to combining evidence: the Ordered Abelian Group (OAG) approach and the uninorm approach. We show that while there exist uninorms that are not extended OAG's it turns out that for operations which are continuous (in some reasonable sense), these two approaches coincide.
Review of “Beginning POJOs: From Novice to Professional by Brian Sam-Bodden”, Apress, 2006, $39.99, ISBN: 1590595963
Authors: S. Balaraman
Venue: Queue (2007)

Anirban Chakrabarti, Springer, 2007, $69.95, ISBN: 3540444920. One popular aspect of grid computing is the promise of getting computing power anywhere. As with electricity, you just plug in and use it, regardless of how or from where it is being delivered. This analogy works well to understand the ultimate goal of grid computing, but of course reality is much more complex. Many advances in interoperability and performance in recent years make grid technologies an alternative to cluster computing for certain distributed applications. Now is the time to focus attention on other problems, such as security. In Grid Computing Security, Anirban Chakrabarti studies security issues related not only to grids, but also to computer networks and operating systems that may affect future development.
Knowledge Reduction in Consistent Incomplete Decision Systems Based on Dempster-Shafer Theory of Evidence
Authors: Wei-Zhi Wu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Knowledge reduction is an important issue in knowledge representation and knowledge discovery. This paper deals with knowledge reduction in consistent incomplete decision systems based on Dempster-Shafer theory of evidence. We show that, in a consistent incomplete decision system, con- cepts of both of belief reduct and plausibility reduct are equivalent to the concept of relative reduct.
Evolution of a subsumption architecture neurocontroller
Authors: Julian Togelius
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

An approach to robotics called layered evolution and merging features from the subsumption architecture into evolutionary robotics is presented, and its advantages are discussed. This approach is used to construct a layered controller for a simulated robot that learns which light source to approach in an environment with obstacles. The evolvability and performance of layered evolution on this task is compared to (standard) monolithic evolution, incremental and modularised evolution. To corroborate the hypothesis that a layered controller performs at least as well as an integrated one, the evolved layers are merged back into a single network. On the grounds of the test results, it is argued that layered evolution provides a superior approach for many tasks, and it is suggested that this approach may be the key to scaling up evolutionary robotics.
Comments on "Modular Replacement of Combinational Switching Networks"
Authors: R. M. M. Oberman
Venue: IEEE Transactions on Computers (1980)

The result of the "modular replacement of combinational switching networks method" by Schmidt and Metze1is discussed in this correspondence. It shows that the switching function of the last example used to demonstrate the power of the developed computer programs, can be implemented in "library modules" at less than half the cost of the best computer result. With other "non- library" mod
Integration of Patent and Company Databases
Authors: Matteo Magnani, Danilo Montesi
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

In this paper we describe an activity of information integration performed on databases with patent data and company indicators. In particular, we present a detailed case study on company name matching. We show how to choose and tune existing methods to work on the domain object of this paper, and describe an efficient implementation to process large volumes of data. The integration activity involves the application of approximate string matching techniques. Then, we show the experimental results obtained on real data sets, highlighting the pros and cons of approximate string matching in this specific domain, and analyze the impact of domain knowledge on the results of the matching activity.