ppxscal/embedding_network huggingface dataset:
Sparse Coding Neural Gas: Learning of overcomplete data representations
Authors: Kai Labusch, Erhardt Barth, Thomas Martinetz
Venue: Neurocomputing (2009)

We consider the problem of learning an unknown (overcomplete) basis from data that are generated from unknown and sparse linear combinations. Introducing the Sparse Coding Neural Gas algorithm, we show how to employ a combination of the original Neural Gas algorithm and Oja's rule in order to learn a simple sparse code that represents each training sample by only one scaled basis vector. We generalize this algorithm by using Orthogonal Matching Pursuit in order to learn a sparse code where each training sample is represented by a linear combination of up to k basis elements. We evaluate the influence of additive noise and the coherence of the original basis on the performance with respect to the reconstruction of the original basis and compare the new method to other state of the art methods. For this analysis, we use artificial data where the original basis is known. Furthermore, we employ our method to learn an overcomplete representation for natural images and obtain an appealing set of basis functions that resemble the receptive fields of neurons in the primary visual cortex. An important result is that the algorithm converges even with a high degree of overcompleteness. A reference implementation of the methods is provided.
An online winding fault detection technique for fault-tolerant PM machines
Authors: Z. Sun, J. Wang, D. Howe, G. W. Jewell
Venue: International Journal of Systems Science (2009)

This article describes an online winding short-circuit fault detection technique for fault-tolerant PM brushless machines. It utilises the voltage induced in search coils wound around the un-wound stator teeth and a Kalman filtering algorithm to detect and identify short-circuit faults in a phase winding. The effectiveness of the fault detection scheme is validated by both simulation and experimental results.
On the Lovász δ-number of almost regular graphs with application to Erdős-Rényi graphs
Authors: E. de Klerk, M. W. Newman, D. V. Pasechnik, R. Sotirov
Venue: European Journal of Combinatorics (2009)

We consider k-regular graphs with loops, and study the Lovász -numbers and Schrijver '-numbers of the graphs that result when the loop edges are removed. We show that the -number dominates a recent eigenvalue upper bound on the stability number due to Godsil and Newman [C.D. Godsil and M.W. Newman. Eigenvalue bounds for independent sets, J. Combin. Theory B 98 (4) (2008) 721-734]. As an application we compute the and ' numbers of certain instances of Erdos-Renyi graphs. This computation exploits the graph symmetry using the methodology introduced in [E. de Klerk, D.V. Pasechnik and A. Schrijver, Reduction of symmetric semidefinite programs using the regular *-representation, Math. Program. B 109 (2-3) (2007) 613-624]. The computed values are strictly better than the Godsil-Newman eigenvalue bounds.
Credibility Based Reputation Calculation in P2P Networks
Authors: R. V. Prasad, Vegi Srinivas, V. Valli Kumari, K. V. Raju
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

Trust management and reputation computation is a major issue in P2P networks. This paper presents a method for reputation calculation based on credibilities of peers. The credibility of a peer is found based on feedback similarity, vendor similarity, interactions similarity and transaction age. The reputation computation system also allows a corrective mechanism, if the feedbacks are from more number of malicious peers. Results that support our claims are presented.
A Kind of Communication Simulation System for WorldFIP Field Intelligent Control Network
Authors: Geng Liang, Guotian Yang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Simulation of communication system in control network plays important role in modern industrial production and can be used in various application. Based on development of WorldFIP field intelligent control network, a kind of communication simulation system was designed and implemented. Simulation principle and implementation methods for data communication in the network were presented. Design and implementation for simulation of network scheduler, intelligent nodes and WorldFIP network communication based on OOP and multi-thread methods were presented in detail. Visual and multi-layered HMI for the simulation system was designed. Techniques in OOP were fully used in design with VC.NET as principle programming language. Complete simulation of WorldFIP communication network and field intelligent nodes was implemented. Operational practice showed the simulation system was stable in operation, good in flexibility and portability, which showed good practicability.
A soft computing-based approach to spatio-temporal prediction
Authors: Rúbia E. O. Schultz, Tania M. Centeno, Gilles Selleron, Myriam R. Delgado
Venue: International Journal of Approximate Reasoning (2009)

This paper aims to incorporate intelligent mechanisms based on Soft Computing in Geographical Information Systems (GIS). The proposal here is to present a spatio-temporal prediction method of forestry evolution for a sequence of binary images by means of fuzzy inference systems (FIS), genetic algorithm (GA) and genetic programming (GP). The main inference is based on a fuzzy system which processes a set of crisp/fuzzy relations and infers a crisp relation representing the predicted image at a predefined date. The fuzzy system is formed by a fixed fuzzy rule base and a partition set that may be defined by an expert or optimized by means of a GA. Genetic programming may also be adopted to generate the size of predicted area used in the final stage of the inference process. The developed methodology is applied in regions of Venezuela, France and Guatemala to identify their forestry evolution trends. The proposed approaches are compared with other techniques to validate the system.
Performance analysis of STBC-UWB systems with double binary turbo code
Authors: Jae Sung Park, Jin Young Kim
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, the performance of space time block coded ultra wide band (STBC-UWB) systems with double binary turbo code is analyzed in additive white Gaussian noise (AWGN) channel. Binary pulse position modulation-time hopping (BPPM-TH) signals are distorted by contains delay and multiple access interference. A space time block code (STBC) based on orthogonal pulses is an efficient method to improve the performance of UWB systems by spatial diversity. Because the UWB channel is highly time scattered with large number of multi-path and a transmit waveform's power is limited to low level, a data signals are distorted by channel error. Thus, we propose the new scheme that the double-binary turbo code is included to the conventional technique (STBC-UWB). Simulations support analysis, for several types of systems (UWB, a double binary turbo coded UWB, STBC-UWB, and a double binary turbo coded STBC-UWB), different code rates, and the number of decoding iteration. From the simulation results, the double binary turbo coded STBC signaling scheme improves the bit error rate performance than the conventional scheme (STBC-UWB).
A Hybrid Algorithm for Vehicle Routing Problem with Time Windows
Authors: Dengying Jiang, Wenxia Jiang, Zhangcan Huang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The VRPTW is a well-known and complex combinatorial problem which has considerable attention in recent years. Combinatorial optimization problems of this kind are NP-hard and are best solved to near optimum by heuristics. Here, we propose a two-stage optimization strategy for VRPTW. Firstly, for constructing a good initial solution, we use the stochastic PFIH, guaranteeing the diversity of the initial solution. And then a hybrid system based on the combination of SA and LNS is proposed to optimize the initial solution. Secondly, tune time windows for the customers using a regression iterative strategy which is put forward to and figure out the optimum time for each vehicle departing. It can make the total waiting time zero. The test of this work is executed over the type C101 in Solomon's VRPTW instances. It is proved by the experiment that our algorithm can solve VRPTW efficiently and quickly.
Computer performance variability
Authors: Thomas E. Bell
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

During a period when computing on a network is free, users can be very informal about choosing the computer for running their jobs. Certain issues usually dominate this informal evaluation---the convenience of entering jobs, the availability of attractive services, the reliability of the system, and the individual user's familiarity with the system's conventions. These informal evaluations are usually qualitative, but one additional, quantitative characteristic is often included---response time.
Atomicity Analysis of Service Composition across Organizations
Authors: Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu
Venue: IEEE Transactions on Software Engineering (2009)

Atomicity is a highly desirable property for achieving application consistency in service compositions. To achieve atomicity, a service composition should satisfy the atomicity sphere, a structural criterion for the backend processes of involved services. Existing analysis techniques for atomicity sphere generally assume complete knowledge of all involved backend processes. Such an assumption is invalid when some service providers do not release all details of their backend processes to service consumers outside the organizations. To address this problem, we propose a process algebraic framework to publish atomicity-equivalent public views from the backend processes. These public views extract relevant task properties and reveal only partial process details that service providers need to expose. Our framework enables the analysis of atomicity sphere for service compositions using these public views instead of their backend processes. This allows service consumers to choose suitable services such that their composition satisfies the atomicity sphere without disclosing the details of their backend processes. Based on the theoretical result, we present algorithms to construct atomicity-equivalent public views and to analyze the atomicity sphere for a service composition. Two case studies from supply chain and insurance domains are given to evaluate our proposal and demonstrate the applicability of our approach.
Line processor: a device for amplification of display terminal capabilities for text manipulation
Authors: Donald I. Andrews
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The Line Processor is a microcomputer-based device that was developed at Stanford Research Institute's Augmentation Research Center (ARC). It was designed to make it possible to use inexpensive alphanumeric video display terminals with ARC's sophisticated interactive information manipulation system, NLS.
A proposal for coordinator control recipe in a batch process
Authors: José Francisco Briones de la Torre, Antonio Espuña Camarasa, Luis Puigjaner i Corbella
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this work, we propose a coordinator control recipe in the context of a batch process with the use of elements of petri nets and some techniques associated with non linear control (e.g. the relative degree) focused to explain the implications of use a hybrid dynamical models in terms of problem control and its relation with on-line experimental measures and the norm ISA S88.02
Online Character Recognition Using Elastic Curvature Matching
Authors: Jong-Hoon Ahn, Jihyun Lee, Jinsu Jo, Yon-Ha Choi, Yillbyung Lee
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

An efficient method for online character recognition is suggested. It consists of two steps: curvature extraction and curvature matching. The online signal with a single stroke is a sequence of two-dimensional positional vectors whereas its curvature is one-dimensional. Elastic curvature matching is basically a 1D-to-1D matching problem between curvatures of reference and test characters, and one-dimensionality of curvature makes the matching problem more quick and easy than 2D-to-2D matching. We show the results obtained from applying it to online digit recognition and discuss them.
Evaluation of Foreign Exchange Risk Based on Financial Data Mining: Evidence from Iron and Steel Industry in China
Authors: Yaqiong Pan
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The purpose of this research is to evaluate the foreign exchange risk exposure of listed companies on the Shanghai and Shenzhen Stock Exchange from iron and steel industry based on panel data over the period July 2005 to July 2008. The augmented Jorion Model is built to estimate the sensitivity of stock returns to exchange rate fluctuation. The findings are shown as follows: (1) Chinese iron and steel industry has significant exposure to foreign exchange risk, which is significantly exposed to USD and JPY, and is insensitive to EUR and HKD. (2) The appreciation of RMB-JPY adversely affects firm returns, while firms are benefited from the appreciation of RMB-USD. (3)The US dollar is the most dominant source of exchange risk among the major currencies, and Japanese Yen is the second one. (4) Affected by other factors except exchange rates and average stock market return, it has fixed effect.
Abstraction and analysis of clinical guidance trees
Authors: Kenneth J. Turner
Venue: Journal of Biomedical Informatics (2009)

Objectives: The aims of this work were: to define an abstract notation for interactive decision trees; to formally analyse exploration errors in such trees through automated translation to Lotos (language of temporal ordering specification); to generate tree implementations through automated translation for an existing tree viewer, and to demonstrate the approach on healthcare examples created by the CGT (clinical guidance tree) project. Approach: An abstract and machine-readable notation was developed for describing clinical guidance trees: Ad/it (abstract decision/interactive trees). A methodology has been designed for creating trees using Ad/it. In particular, tree structure is separated from tree content. Tree structure and flow are designed and evaluated before committing to detailed content of the tree. Software tools have been created to translate Ad/it tree descriptions into Lotos and into CGT Viewer format. These representations support formal analysis and interactive exploration of decision trees. Through automated conversion of existing CGT trees, realistic healthcare applications have been used to validate the approach. Results: All key objectives of the work have been achieved. An abstract notation has been created for decision trees, and is supported by automated translation and analysis. Although healthcare applications have been the main focus to date, the approach is generic and of value in almost any domain where decision trees are useful.
Aspect-oriented support for synchronization in parallel computing
Authors: Chenchen Xi, Bruno Harbulot, John R. Gurd
Venue: Proceedings of the 1st workshop on Linking aspect technology and evolution (2009)

Presents case studies for, and implementations of, synchronized block join points that together augment the capabilities of join points for synchronized methods in intercepting and modifying synchronization actions in distributed, Java-based, aspect oriented software. The models are applicable in any aspect oriented environment, but emphasis is placed on compatibility with AspectJ. The power of such a join point is first illustrated by analysing some case studies. While some such examples can be handled using aspects that intercept synchronized method calls, a fully general scheme is shown to need with Java synchronized blocks. The approach for recognising the synchronized block uses context exposure to provide full control of the thread behaviour when many threads compete to be executed. The proposed join point model is enhanced with a mechanism for removal of unnecessary synchronization, which is vital for reducing overheads associated with the lock. There is also a facility for re-introducing necessary synchronization that has previously been removed.
Key policy, regulatory and standards issues in global satellite communications
Authors: Joseph N. Pelton, Kul Bhasin
Venue: Space Communications (2000)

The field of satellite communications is becoming at least as constrained and shaped by policy, regulatory and standards issues as it is by technology. Satellite communications is currently facing a host of challenging issues, including national economic competition, open trade issues, standards and protocols, spectrum and frequency allocation, definition of essential space services requiring public funding, institutional reform, international industrial patterns of change and consolidation, technology transfer, and the proper role of government in future space communications development. This article seeks to identify possible areas for reform with regard to 'paper satellites', multi-purpose frequency allocations, longer range spectrum planning, new standards-making approaches to seamless satellite-fiber interconnectivity, and reforms to more open international trade and licensing of satellite systems. Specific issues addressed include: Global trade and access to national markets in the new 'open markets' trading environment. Interoperability standards and protocols. Issues of compatibility among the satellite systems of the world. Access to needed frequency allocations for satellite services amid growing global demand for broad band multi-media services and the need to revise ITU planning processes. The difference in policy perspective and objectives between developed and developing countries in the field of satellite communications and its applications. The on-going problem of 'paper satellites' and the fact that 'due diligence' has not solved this problem. Needed regulatory reforms to encourage new types of interactive broadband, multi-media satellites. Institutional reforms of key entities (the ITU, INTELSAT, Inmarsat, etc.) in the coming decade. Technology transfer issues, especially those that involve sensitive or strategic issues as well as streamlined methods to protect international property rights. New patterns of industrial cooperation, merger and as the new global market emerges. The proper role of governmental R D support in developing new technology, applications and markets.
Unifying Themes in Complex Systems, Vol. IIIB: New Research
Authors: Ali A. Minai, Yaneer Bar-Yam
Venue: New England Complex Systems Institute Series On Complexity (2007)

In recent years, scientists have applied the principles of complex systems science to increasingly diverse fields. The results have been nothing short of remarkable: their novel approaches have provided answers to long-standing questions in biology, ecology, physics, engineering, computer science, economics, psychology and sociology. The Third International Conference on Complex Systems attracted over 400 researchers from around the world. The conference aimed to encourage cross-fertilization between the many disciplines represented and to deepen our understanding of the properties common to all complex systems.
Modelling reliability in GaN HEMT devices
Authors: T. Fernández, F. Sánchez, M. Verdú, A. Tazó, A. Mimouni, J. A. Garcia, A. Mediavilla
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper a study of the evolution over time of four different magnitudes in GaN HEMT's will be presented. The experimental data measured at III-V Lab's, as a result of a Life Test performed using as test vehicles six different GaN HEMT devices, allow the authors to find a way of modelling reliability by using specific mathematical functions developed to simulate the temporal dependence of such as magnitudes. The accuracy of the simulations validates the proposed approach.
Research of Service Flow Authentication Relocation
Authors: Lingjiao Wang, Zhengkun Mi, Hua Guo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

SFA management is an essential element in the WiMAX network architecture. However, there are some issues, which are the abruptions between the authenticator and the ASFA and between the anchor GW and the SSFA. The abruptions result from the mobility management in WiMAX network architecture and bring on that service flow service provided to mobile users can’t be accomplished. Network exit may take place because the incorrect communication from the abruptions. The issues are figured out by the ASFA relocation algorithm and the SSFA relocation algorithm presented in the paper. The algorithms proposed can implement the normal communication between the ASFA and the SSFA. And mobile users can obtain the anticipant service flow. Therefore, the network exit and the states mismatch can be avoided. The proposed scheme can be implemented through minimally modifying the existing Mobile-WiMAX specification. Furthermore, after the relocation of SSFA follows the change of the anchor point in the CSN mobility management, the ASFA is not conscious of the location movement of the SSFA. In this paper, the context transfer is applied for notifying the current location of the SSFA to the ASFA.
Personal Information Ecosystems: Design Concerns for Net-Enabled Devices
Authors: Manuel A. Pérez-Quiñones, Manas Tungare, Pardha S. Pyla, Steve Harrison
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

Today, with the proliferation of affordable computing, people use multiple devices to fulfill their information needs. Designers approach each device platform individually, without accounting for the other devices that users may also use. In many cases, the software applications on all the user's devices are designed to be functional replicates of each other, often with an emphasis on keeping their form and function consistent with the same application on other device platforms. In this paper, we present the idea of a personal information ecosystem, an analogy to biological ecosystems, which allows us to discuss the inter-relationships among users' devices. Using the examples of now-ubiquitous web-enabled devices, we discuss how considering the user's ecosystem of devices as a holistic design target gives designers and researchers a language to describe and discuss the design of applications that span multiple devices.
Is it worthwhile to develop a new programming language?
Authors: Karek Babcicky
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The paper presents an industry project aiming at the development of a special purpose programming language. Although the language primary objective was rather specific, the result turned out to be a language suitable for system modeling and control. The author lists pros and cons of the effort related to the development of a new language and offers some hints for further work.