ppxscal/embedding_network huggingface dataset:
Fuzzy logic approach for future load curve forecasting based on similarity
Authors: Tomonobu Senjyu, Shuzo Higa, Katsumi Uezato
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

Load forecasting has always been an essential part of efficient power system planning and operations. In this paper, we propose the fuzzy logic approach for future load curve forecasting based on similarity. The proposed approach has the advantage of dealing with not only the nonlinear part of forecasted load curve but also with load curve forecasting without distinction of day type. In addition to the above mentioned advantages, the proposed method is useful in situations where accurate forecasting models are difficult to design. The fuzzy logic approach is used to modify the load curves on similar days in order to shape the next day load curve. The suitability of the proposed approach is illustrated through an application to actual load data of the Okinawa Electric Power Company in Japan.
Computational methods for Traditional Chinese Medicine: A survey
Authors: Suryani Lukman, Yulan He, Siu-Cheung Hui
Venue: Computer Methods and Programs in Biomedicine (2007)

Traditional Chinese Medicine (TCM) has been actively researched through various approaches, including computational techniques. A review on basic elements of TCM is provided to illuminate various challenges and progresses in its study using computational methods. Information on various TCM formulations, in particular resources on databases of TCM formulations and their integration to Western medicine, are analyzed in several facets, such as TCM classifications, types of databases, and mining tools. Aspects of computational TCM diagnosis, namely inspection, auscultation, pulse analysis as well as TCM expert systems are reviewed in term of their benefits and drawbacks. Various approaches on exploring relationships among TCM components and finding genes/proteins relating to TCM symptom complex are also studied. This survey provides a summary on the advance of computational approaches for TCM and will be useful for future knowledge discovery in this area.
Solutions to generalized Sylvester matrix equation by Schur decomposition
Authors: Bin Zhou, Guang-Ren Duan
Venue: International Journal of Systems Science (2007)

This note deals with the problem of solving the generalized Sylvester matrix equation AV - EVF = BW, with F being an arbitrary matrix, and provides complete general parametric expressions for the matrices V and W satisfying this equation. The primary feature of this approach is that the matrix F is firstly transformed into triangular form by Schur decomposition and then unimodular transformation or singular value decomposition are employed. The results can be easily extended to second order case and high order case and can provide great convenience to the computation and analysis of the solutions to this class of equations, and can perform important functions in many analysis and design problems in control systems theory.
Slack-based Bus Arbitration Scheme for Soft Real-time Constrained Embedded Systems
Authors: Minje Jun, Kwanhu Bang, Hyuk-Jun Lee, Naehyuck Chang, Eui-Young Chung
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints, resulting in the satisfaction of system-level timing constraints. The computation time of each master is predictable, but it is not easy to predict its data transfer time since the communication architecture is mostly shared by several masters. Previous works solved this issue by minimizing the latencies of several latency-critical masters, but the side effect of these methods is that it can increase the latencies of other masters, hence they may violate the given timing constraints. Unlike previous works, our method uses the concept of "slack" in order to make the latency as close as its given constraint, resulting in the reduction of the side effect. The proposed arbitration scheme consists of bandwidth-conscious arbiter and scheduler. The arbiter can be any existing bandwidth-conscious arbiter and the scheduler implements the latency-awareness proposed in this paper. The scheduler is involved in the arbitration only when it observes a request whose slack is not sufficient for the given timing constraint. The experimental results show that our method outperforms the conventional round-robin arbiter by more than 100% in the best case in terms of the longest violated cycles.
Threshold voltage model for small geometry AlGaN/GaN HEMTs based on analytical solution of 3-D Poisson's equation
Authors: Sona P. Kumar, Anju Agrawal, Rishu Chaujar, Sneha Kabra, Mridula Gupta, R. S. Gupta
Venue: Microelectronics Journal (2007)

A simple and accurate analytical model for the threshold voltage of AlGaN/GaN high electron mobility transistor (HEMT) is developed by solving three-dimensional (3-D) Poisson equation to investigate the short channel effects (SCEs) and the narrow width effects present simultaneously in a small geometry device. It has been demonstrated that the proposed model correctly predicts the potential and electric field distribution along the channel. In the proposed model, the effect of important parameters such as the thickness of the barrier layer and its doping on the threshold voltage has also been included. The model is, further, extended to find an expression for the threshold voltage in the sub-micrometer regime. The accuracy of the proposed analytical model is verified by comparing the model results with 3-D device simulations for different gate lengths and widths.
State-transition machines for lambda-calculus expressions
Authors: David A. Schmidt
Venue: Higher-Order and Symbolic Computation (2007)

The process of compiler generation from lambda-calculus definitions is studied. The compiling schemes developed utilize as their object language the set of state transition machines (STMs): automata-like transition sets using first-order arguments. An intermediate definition form, the STM-interpreter, is treated as central to the formulation of STMs. Three compiling schemes are presented: one derived directly from an STM-interpreter for the lambda-calculus; one formulated from an STM-interpreter variant of Landin's SECD-machine; and one defined through meaning-preserving transformations upon a denotational definition of the lambda-calculus. The results are compared and some tentative conclusions are made regarding the utility of compiler generation with the STM forms.
Secure M-commerce Transactions: A Third Party Based Signature Protocol
Authors: Lisha He, Ning Zhang, Lirong He, Ian Rogers
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper, we present a novel joint signature protocol suited to applications run on UMTS and heterogeneous networks. The protocol enables a mobile user to securely delegate his/her signing power to an assisted server so that the assisted server can perform signature generation and verification on behalf of the user. By shifting computational expensive cryptographic operations to a third party, i.e. the assisted server, the protocol is able to eliminate public key operations for the mobile end, while providing message origin authentication, integrity, and non-repudiation services to both delegated (i.e. the mobile user) and delegating (i.e. the third party) entities. The protocol is suited to m-commerce applications, in which a mobile user with a resource restrictive device wishes to access Internet-based security-sensitive services. The security of the proposed protocol is analyzed and its performance against other related work is evaluated.
Candidate Vectors Selection for Training Support Vector Machines
Authors: Minqiang Li, Fuzan Chen, Jisong Kou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper, a novel and concise method for the selection of candidate vectors (SCV) is proposed based on the structural information of two classes in the input space. First, the Euclidean distance of all samples to the boundary of the other classes is calculated. Then the relative distance is computed to reorder training samples ascendingly, and boundary samples will rank in front of others and have a higher probability to be candidate support vectors. A certain proportion of the foremost ranked samples are selected to form examples subset for training the SVM classification function by using the SMO. For linearly non-separable datasets with noise, an abnormal examples filtering (AEF) procedure is designed to find abnormal examples or outliers that may give rise to the distortion of structural information on the boundaries of two classes. Finally, two datasets are used to test the prediction accuracy of the SVM decision function estimated by the SMO and the AEF+SCV+SMO.
IMM fuzzy probabilistic data association algorithm for tracking maneuvering target
Authors: Ilke Turkmen
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper, a new interacting multiple model fuzzy probabilistic data association (IMM-FPDA) algorithm is proposed for tracking maneuvering target. In the proposed tracker, fuzzy logic is incorporated in a conventional IMM-PDA method. In order to determine process noise covariance of the Kalman filter used in IMM-PDA, the prediction error and change of the prediction error in the last prediction are used as fuzzy inputs. To optimize parameters of the fuzzy system, a tabu search algorithm is utilized. The IMM-FPDA tracker combines advantages of the FPDA and IMM algorithms. The performance of the proposed algorithm is compared with those of the IMM and PDA-IMM algorithms using two different maneuvering tracking scenarios. It is shown from simulation results that the IMM-FPDA algorithm greatly outperforms the IMM and IMM-PDA algorithms in terms of tracking error.
Analysis of Local Address Scanning by Puppetnets
Authors: David M. Nicol
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Puppetnets are created when a web server hosts a page that when loaded simultaneously by many users causes malicious behavior; there are a wide variety of means by which puppetnets can cause mischief. This paper analyzes the behavior and effectiveness of puppetnets for Internet reconnaissance--methodical means of discovering live IP addresses--as a prelude to another attack. We consider local reconnaissance, in which the client reconnoiters addresses in its local IP neighborhood. We focus on modeling critical facets that impact coverage--the fraction of addresses analyzed--as a function of time. We prove that certain scanning strategies are superior to others, and develop formulae that describe the inefficiencies due to lack of coordination. Finally we use the model to estimate how global Internet coverage grows as a function of time, under generous assumptions about the size of puppetnet and length of script execution. We see that even a strategy that focuses on exploring blocks of adjacent live addresses may take days to map a significant fraction of the Internet address space.
Similarity Measures on Intuitionistic Fuzzy Sets
Authors: Zhen Zhou, Wu Qi-zong
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, firstly, some existing measures of similarity are reviewed. Then we showed by some examples that some existing similarity measures do not fit well in some cases. At the same time, several new similarity measures are proposed and the relationships between some similarity measures are proved. Finally a comparison is made to show the proposed similarity measures are more reasonable than some existing similarity measures in general cases.
Speeding Up Similarity Queries over Large Chinese Calligraphic Character Databases Using Data Grid
Authors: Yi Zhuang, Yueting Zhuang, Qing Li, Fei Wu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

This paper proposes a novel data-grid-based k nearest neighbor query over large Chinese calligraphic character databases, which can significantly speed up the retrieval efficiency. Three steps are made. Firstly, when a user submits a query request to a query node, a process of character set reduction is performed using iDistance index in different data nodes, followed by sending the candidate characters to the executing nodes through a package-based transfer technique. Secondly, a refinement process of the candidate characters is conducted in the executing nodes in parallel to get the answer set. Finally, the answer set is transferred to the query node. The proposed method incorporates a uniform-startdistance- based character data allocation policy and character reduction algorithm. The analysis and experimental results show that the performance of the algorithm is effective in minimizing the response time by decreasing network transfer cost and increasing the parallelism of I/O and CPU.
Quantum Information Security Protocols and Quantum Coding Theory
Authors: Xin Lu, Zhi Ma
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Quantum computation has important impacts on information security and modern cryptography. In 1994, Shor demonstrated that the problem of finding the prim factors of an integer, and the so called "discrete logarithm problem" could be solved efficiently on a quantum computer. Quantum information can also be proved to devise unconditionally secure cryptography protocols. In this paper, we introduce the most recent research progress in quantum information security and quantum coding theory and review several quantum quantum cryptography protocols that we have proposed.
Gepard
Authors: Jan Krumsiek, Roland Arnold, Thomas Rattei
Venue: Bioinformatics (2007)

Summary: Gepard provides a user-friendly, interactive application for the quick creation of dotplots. It utilizes suffix arrays to reduce the time complexity of dotplot calculation to Θ(m*log n). A client–server mode, which is a novel feature for dotplot creation software, allows the user to calculate dotplots and color them by functional annotation without any prior downloading of sequence or annotation data. Availability: Both source codes and executable binaries are available at http://mips.gsf.de/services/analysis/gepard Contact: krumsiek@in.tum.de
Model Driven Development of Software Product Lines
Authors: Alexandre Braganca, Ricardo J. Machado
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Software product lines and related approaches, like software factories, are starting to capture the attention of the industry practitioners. Nevertheless, their adoption outside the research community and big companies is still very restricted. We believe that model-driven approaches, like OMG's MDA, with proper tool support, can bring the advantages of product lines to a broader audience. In this thesis we propose an approach to achieve this goal in which modeling is inspired by UML and automation is based on metamodeling and transformation languages using publicly available tools.
IP Local Node Protection
Authors: Hui-Kai Su, Cheng-Shong Wu, Yuan-Sun Chu
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Network survivability has become one of the most important QoS (Quality of Service) parameters in IP network services. IP protection can improve network resilience and avoid service disruption better than traditional routing recovery or other lower layer recovery technologies. In this paper, we proposed an IP Local Node-Protection (IPLNP) scheme based on the characteristic of shortest path routing in IP networks. Our schemes working in an intra-area routing domain provide simple and efficient solutions to improve IP network survivability. Unlike source-routing-based MPLS (Multi-Protocol Label Switching) Fast-Reroute which needs an extra MPLS layer and complex control protocols, our scheme are applicable to a network employing only conventional IP routing and forwarding. Our scheme can prevent service disruption and packet loss caused by the loops which normally occur during the re-convergence of the network upon a failure. Because the backup next hops are predetermined in advance, the service interrupted time can be limited to a few milliseconds. In the simulation results, we observe that IP Local Node-Protection scheme can efficiently improve network survivability while single node failure occurs.
Performance Modeling and Evaluation of e-commerce Systems Using UML 2.0
Authors: D. Evangelin Geetha, Ch. Ram Mohan Reddy, T. V. Suresh Kumar, K. Rajani Kanth
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Constructing performance models of e-commerce systems is expensive to develop and validate. Performance assurance is a methodology that, when applied during the design and development cycle, will greatly increase the chances of immediate user satisfaction in an e-commerce project. System performance validation provides assurance that a system as a whole is likely to meet its quantitative performance goals. It applies performance engineering methods and tools during a system's development and has to be integrated into the design process from the very beginning through to system deployment. In this paper, we discuss the transformation of Unified Modeling Language (UML) models into software execution models and simulate the performance prediction for an e-commerce application. We exploit the features of UML 2.0. Application of the procedure is illustrated with a case study of e-parking system.
Data Management II
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Meta-schedulers such as the LSF MultiCluster scheduler and the Moab meta-scheduler (Silver) are being deployed on clusters interconnected over the grid. A primary goal of such meta-schedulers is to share jobs amongst the individual local sites, balancing the load and improving utilization and turnaround time. This work focuses on current methodologies used in implemented meta-schedulers, such as LSF MultiCluster and Silver. The benefits and disadvantages of both centralized and delegated modes are evaluated. Focusing on the negative impact of meta-schedulers to jobs originating from lightly loaded sites, enhancements are proposed and evaluated via trace-driven simulation. It is shown that it is feasible to reduce the detrimental impact on lightly loaded sites while maintaining excellent overall performance. 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
Correction to "Error-Correcting Parsers for Formal Languages"
Authors: E. Tanaka
Venue: IEEE Transactions on Computers (1982)

In our earlier paper1 we proposed an algorithm S for error-correcting parsing of formal languages. It is found recently that two additional CS conditions and a routine for detecting infinite loop are required for the algorithm S.
WNB: A Weighted Naïve Bayesian Classifier
Authors: Saul D. de S.Pedro, Estevam R. Hruschka, Eduardo R. Hruschka, Nelson F. F. Ebecken
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The Naïve Bayes Classifier (NB) aims at classifying a given instance into a discrete class considering that all attributes are conditionally independent given the class. NB has been extensively used for modeling knowledge in many different applications and has been the focus of many works related to classification tasks. This work proposes and discusses a Naïve Bayesian classifier named Weighted Naïve Bayesian (WNB) classifier. The central idea of WNB is that more relevant attributes should have more influence in the classification estimation process. A weighting strategy is adopted to modify the traditional NB. Experiments performed with six UCI domains show that WNB is promising.
Extracting Features of Paper-made Objects Recognized from Origami Books Based on Design Knowledge
Authors: Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper proposes an approach to extracting features of origami works which are recognized from facing page images of instructions described as origami drill books. The origami work is presented as a set of faces (polygons). First, in order to associate geometric shapes of objects with knowledge, an origami data model based on design knowledge is proposed. Therefore, the set of faces is classified into clusters which indicate a certain meaning in origami design. The cluster is called "origami molecule". Next, the relationships among the molecules are defined. The relationships are not only connected relationships but also symmetrical relationships and equivalence relationships. By using these relationships, it is possible to comprehend twin parts of origami work, for example, two forefeet of the fourlimbed creature. Finally, a method for extraction of the design knowledge from crease patterns is proposed.
Bare-handed electronic voting with pre-processing
Authors: Ben Riva, Amnon Ta-Shma
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

Many electronic voting schemes assume the user votes with some computing device. This raises the question whether a voter can trust the device he is using. Three years ago, Chaum, and independently Neff, proposed what we call bare-handed electronic voting, where voters do not need any computational power. Their scheme has a very strong unforgeability guarantee. The price for that, however, is that they require the voter to tell his vote to the voting booth. In this paper we propose a scheme where the voter votes bare-handedly, and still maintains his privacy even with respect to the voting booth. We do this by allowing the voter the use of a computer device but only at a pre-processing stage - the voting itself is done barehandedly. This has many advantages. A voter who has to verify calculations at the booth has to trust the software he is using, while a voter who verifies pre-processed calculations can do that at his own time, getting help from whatever parties he trusts. Achieving private, coercion-resistance, barehanded voting with pre-processing is a non-trivial task and we achieve that only for elections with a bounded number of candidates. Our solution works by proposing an extension to known voting schemes. We show that such extended schemes enjoy the same unforgeability guarantee as that of Chaum and Neff. In addition, our extended scheme is private, and the voter does not reveal his vote to the booth.