ppxscal/embedding_network huggingface dataset:
Comparison procedure of predicting the time to default in behavioural scoring
Authors: Natasa Sarlija, Mirta Bensic, Marijana Zekic-Susac
Venue: Expert Systems with Applications: An International Journal (2009)

The paper deals with the problem of predicting the time to default in credit behavioural scoring. This area opens a possibility of including a dynamic component in behavioural scoring modelling which enables making decisions related to limit, collection and recovery strategies, retention and attrition, as well as providing an insight into the profitability, pricing or term structure of the loan. In this paper, we compare survival analysis and neural networks in terms of modelling and results. The neural network architecture is designed such that its output is comparable to the survival analysis output. Six neural network models were created, one for each period of default. A radial basis neural network algorithm was used to test all six models. The survival model used a Cox modelling procedure. Further, different performance measures of all models were discussed since even in highly accurate scoring models, misclassification patterns appear. A systematic comparison '3+2+2' procedure is suggested to find the most effective model for a bank. Additionally, the survival analysis model is compared to neural network models according to the relative importance of different variables in predicting the time to default. Although different models can have very similar performance measures they may consist of different variables. The dataset used for the research was collected from a Croatian bank and credit customers were observed during a 12-month period. The paper emphasizes the importance of conducting a detailed comparison procedure while selecting the best model that satisfies the users' interest.
Finite Automata and Application to Cryptography
Authors: Renji Tao
Venue:  (2009)

Finite Automata and Application to Cryptography mainly deals with the invertibility theory of finite automata and its application to cryptography. In addition, autonomous finite automata and Latin arrays, which are relative to the canonical form for one-key cryptosystems based on finite automata, are also discussed. Finite automata are regarded as a natural model for ciphers. The Ra Rb transformation method is introduced to deal with the structure problem of such automata; then public key cryptosystems based on finite automata and a canonical form for one-key ciphers implementable by finite automata with bounded-error-propagation and without data expansion are proposed. The book may be used as a reference for computer science and mathematics majors, including seniors and graduate students. Renji Tao is a Professor at the Institute of Software, Chinese Academy of Sciences, Beijing.
Better manpower utilization using automatic restructuring
Authors: Guy de Balbine
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Our intent is to introduce the concept of automatic restructuring as a powerful method for improving the quality of software developed before the advent of structured programming. The quality improvements we are concerned with are neither execution time efficiency nor core size requirements but, rather, higher readability and clear structured code. These, in turn, should improve the reliability and reduce the maintenance costs by making human verification more efficient.
A Negotiation and Resource Reservation Protocol (NRP) for Configurable Multimedia Applications
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Distributed multimedia applications require negotiation of quality of service (QoS) and resource reservation for distributed application parts and communication links. Negotiation of QoS is a balancing process between the QoS specified by a client, the resource availabilities of the distributed system and the functional capabilities of the distributed application. Negotiation requires application level QoS descriptions and an end-to-end view spanning the whole distributed application. NRP is an application level protocol meeting these requirements. NRP performs negotiation based on client specified QoS value ranges and given resource availability on endsystems and communication links. NRP is independent of application level QoS semantics. It allows QoS negotiation and resource reservation in three phases and supports a wide range of distributed application topologies. 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
Metodology for selecting the best suitable bottleneck detection method
Authors: Eliseu Lima, Leonardo Chwif, Marcos Ribeiro Pereira Barreto
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Focusing on process constraints (or bottlenecks) is how companies are improving productivity, decreasing response times. However, a bottleneck is not easily detectable, especially when conventional bottleneck methods are used. This work presents a method, based on simulation, to help the selection of the bottleneck detection method to be applied to a given situation. The methodology extends previous works on the subject, mainly those by Roser, Nakano and Tanaka (2002) and Roser, Nakano and Tanaka (2003). The proposed method was successfully applied to a real bottling process.
Assessing the needs of CSCL tool and its impacts in Malaysian context
Authors: Z. M. Kasirun, S. S. Salim
Venue: WSEAS Transactions on Computer Research (2008)

Reviewing on computer-supported collaborative learning (CSCL) tools revealed that CSCL is important to support collaborative learning (CL) strategy in school. Existing CSCL applications are mostly research-based and are not available for use. Through a survey on the needs for CSCL in Malaysia, it is confirmed that CSCL application is needed but the available one could not support CL activities. This paper discusses CSCL study in Malaysia, especially the relationship between user involvement and type of CSCL application needed. In particular, the CSCL application that could associate existing knowledge among students to build new knowledge for their better understanding and problem solving skills. We examine this need and assess its impact by developing Collaborative Environment for Teaching and Learning System (CETLs).
Research Developments in Web Information Retrieval from Two Brazilian Universities
Authors: Nivio Ziviani, Edleno Silva de Moura
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

We present in this article a summary of the main research results in the last years in the area of Web Information Retrieval produced by two Brazilian groups, from the Federal University of Amazon as and the Federal University of Minas Gerais. The two groups have worked in several common research projects in the last five years. The research results described here are concentrated in three main topics related to web research: information retrieval models for web search, efficiency issues in web search, and noise removal. The results obtained by the two groups in the last years represent significant contributions to improve both the quality and the efficiency of web search systems.
On the asymptotic and practical complexity of solving bivariate systems over the reals
Authors: Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P. Tsigaridas
Venue: Journal of Symbolic Computation (2009)

This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present three algorithms and analyze their asymptotic bit complexity, obtaining a bound of O@?"B(N^1^4) for the purely projection-based method, and O@?"B(N^1^2) for two subresultant-based methods: this notation ignores polylogarithmic factors, where N bounds the degree, and the bitsize of the polynomials. The previous record bound was O@?"B(N^1^4). Our main tool is signed subresultant sequences. We exploit recent advances on the complexity of univariate root isolation, and extend them to sign evaluation of bivariate polynomials over algebraic numbers, and real root counting for polynomials over an extension field. Our algorithms apply to the problem of simultaneous inequalities; they also compute the topology of real plane algebraic curves in O@?"B(N^1^2), whereas the previous bound was O@?"B(N^1^4). All algorithms have been implemented in maple, in conjunction with numeric filtering. We compare them against fgb/rs, system solvers from synaps, and maple libraries insulate and top, which compute curve topology. Our software is among the most robust, and its runtimes are comparable, or within a small constant factor, with respect to the C/C++ libraries.
The emerging value network in the mobile phone industry: The case of Japan and its implications for the rest of the world
Authors: Jeffrey L. Funk
Venue: Telecommunications Policy (2009)

This paper considers how the mobile phone industry is changing from a value chain to a value network using the Japanese market as an example. Value networks involve a larger number of firms, a more complex set of relationships between them, and agreements on a greater number of interface standards than do value chains. Building from this concept of a value network, the paper shows how: (1) agreements on many of these interface standards are enabling connections to be made between the mobile phone and other industries; (2) the resulting products and services often reflect the technological capability of phones and the existing products and services in these ''other'' industries; (3) each new interface standard requires a new critical mass of users; and (4) a critical mass of users for a new interface standard partly builds from previously created critical masses of users. On a practical level, this paper's analysis adds to a growing list of evidence that the growth in Western mobile Internet markets is nowhere near its potential and that the change from a value chain to a value network requires a different form of standard setting, policy making, and management than are currently used in the mobile phone industry.
Software application implement in java for electrical lines dimensioning
Authors: Cristian Abrudean, Manuela Panoiu
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

In this paper it was present a software package implemented in java useful for dimensioning of low voltage lines mono phase and three phases (AC and DC). The modeled networks are tree type. This software with graphical user interface allows the estimation and calculation of parameters of power transmission lines of electric power. The user has the possibility to input of data and other characteristics of the electric line, passing to the calculation stage when the data are correctly and completely entered. The output of the results is shown on the screen.
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
Authors: Jun Wang, Sijing Zhang, Carsten Maple, Zhengxu Zhao
Venue: Computer Standards Interfaces (2009)

Synchronous bandwidth, defined as the maximum time a node is allowed to send its synchronous messages while holding the token, is a sensitive parameter for deadline guarantees of synchronous messages in any timed token network. In order to offer such guarantees, synchronous bandwidth has to be allocated carefully to each individual node. This paper studies the synchronous bandwidth allocated to those synchronous message streams whose deadlines are less than twice the Target Token Rotation Time (TTRT). A new approach for allocating synchronous bandwidth to such streams, which can be used with any previously published local synchronous bandwidth allocation (SBA) for guaranteeing a general synchronous message set with its minimum deadline (D"m"i"n) no less than 2.TTRT, is proposed. The proposed scheme can be applied efficiently in practice to any general synchronous message set with D"m"i"n>TTRT. Numerical examples are presented to demonstrate the enhanced performance of this new local scheme over any of the previously published local SBA schemes.
Earth observation payload predimensioning software
Authors: Omar Hadj-Sahraoui, Hadria Fizazi
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

For developing countries, as Algeria, who wish to access space with relatively low levels of government funding when compared with developed countries, small and low cost mission to be the good strategy to acquire space techniques and technologies. The success of microsatellites and their cost effective options for a wide range of potential missions led Algeria to opt for microsatellite philosophy. The Algerian Centre of Space Techniques is undertaking a microsatellite space mission analysis for climate data collection and earth observation. A software for SATellite PREdimensioning "PRESAT" is being developed as satellite design tool aid to bring, to the mission analysis phase, the technical parameters necessary to quickly work out a preliminary project. The first version of Earth Observation Payload Predimensioning Software "E.O.P.P.S", as part of the PRESAT, consists of simulating an earth observation system in visible and near infrared bands. This paper describes some options already achieved of the EOPPS software.
Low power asynchronous generator analysis
Authors: Vít Bršlica
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The presented analysis is based on practical results of low power asynchronous generator in the physical model. The tests of variable speed generating set with asynchronous generator and inverter disclose bad efficiency. Inadequately big value of magnetizing current inhibits the exploitation of the bulk asynchronous motor in generator function with appropriate electrical power output. Even at twice higher speed 3000 RPM this machine cannot give the same electric power output, as is its nominal electrical input in motor run at speed 1415 RPM.
Transgression and Atonement
Authors: Kevin M. Knight, Deepthi Chandrasekaran, Aline Normoyle, Ransom Weaver, Barry G. Silverman
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

This paper presents an approach to modeling social transgressions in agent based systems. The approach is intended to be abstract enough that it may be used with many different theories of transgression, apology, forgiveness, etc. In the first half of the paper, we consider what features of transgressions, people's emotional reactions to transgressions, and forgiveness are important, primarily by surveying social sciences literature. In the second half, we discuss an implementation of our approach in PMFserv, an agent based socio-cognitive modeling framework.
Maximal error-detecting capabilities of formal languages
Authors: Stavros Konstantinidis, Pedro V. Silva
Venue: Journal of Automata, Languages and Combinatorics (2008)

A (combinatorial) channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability" of a given language, with respect to a certain class of channels, which is simply a maximal channel for which the given language is error-detecting. The new concept is intended to address formally the question of "finding the largest amount of errors that a language can detect". We focus on rational channels (those described by finite transducers) and on regular languages, and consider the problem of computing maximal error-detecting capabilities of a given regular language for various classes of rational channels. We also discuss briefly the concept "maximal error-correcting capability" of a formal language.
Bridging the Digital Divide: Innovation Systems for ICT in Brazil, China, India, Thailand, and Southern Africa
Authors: Angathevar Baskaran, Mammo Muchie
Venue:  (2007)

"The impressive advances of information and communication technologies (ICT) in some Asian countries have led some people to proclaim a fundamental change in the world economy. The authors and editors have made an admirable contribution to make such an evaluation and fill a big gap in our knowledge..One of the many good features of this evaluation is that it takes into account the specific relationship of ICT with the wider social and economic system and the national system of innovation of each country." Christopher Freeman, Emeritus Professor and Founding Director of the Science Policy Research Unit (SPRU), University of Sussex, Brighton, UK. "Running across the informative chapters on the diverse experience of several important countries with ICT is a unifying theory of what it takes for successful economic development in today's globalized economy... The case studies show different countries wrestling with the problem, some doing better and some worse. This is a fascinating and important book." Richard R. Nelson, George Blumenthal Professor (Emeritus) of International and Public Affairs, Business, and Law, Columbia University, New York, USA. "This book is important because it gives insight into the role of ICT and ICT policy in the most important emerging economies in the world." Bent ke Lundvall, Professor of Economics, Aalborg, University, Denmark. This book was selected as Book of the Month in March 2006 by the Belfer Center for Science and International Affairs at John F Kennedy School of Government at Harvard University, USA. It has been endorsed by some of the leading thinkers in the field, including two Nobel prize nominees in economics. It is also listed as a resource on the world Bank's website. A section of it has been licensed by the Open University UK for its worldwide course on technology.
Distributed remote laboratory using web services for embedded system
Authors: Yin Wei-Feng, Sun Rong-Gao, Wan Zhong
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

Remote laboratories are becoming widely accepted in universities for providing distance education and for augmenting traditional laboratories. In this paper, A remote laboratory for embedded system is presented, where students at remote sites can perform actual experiments using actual hardware equipment and tools concurrently. A Distributed architecture is presented using Web Services technique to share laboratories resource for multi-user. A Integrated learning environment for remote experimentation for embedded system is provided for convenient learning by students self.
Reading (with) the Enemy
Authors: Marc Donner
Venue: IEEE Security and Privacy (2009)

Associate editor in chief Marc Donner explains why it's still worth reading "bad-guy writing"—and publishing book reviews about those works.
Assignment of probabilities to events for combat simulation
Authors: John B. Gilmer,  Jr., Frederick J. Sullivan
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Multitrajectory simulation allows explicit management of random events by allowing particular events to be resolved by random draw, by a deterministic choice, or by creating new states to allow following multiple trajectories. The policy for resolution method is under the control of the analyst, and may depend on event type, trajectory probability, or even some metric indicating the trajectory importance. However, taking advantage of the technique for exploring possible outcome spaces requires a probabilistic modeling of events that, in simulations of ground combat, are often treated as deterministic, such as decisionmaking. Even for events such as attrition, which have long been modeled as stochastic, how should the full event outcome set be sampled if one is only to keep two or three samples? This paper explores these issues with the goal of outlining what kinds of data would be needed to fully exploit multitrajectory methods in a combat simulation context.
A Stereo Self-adjustment Methodology for Resuming Active Camera Operation
Authors: Masafumi Nakagawa, Yoshihiro Kawai, Fumiaki Tomita
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

A stereo system for vehicles, Unmanned Aerial Vehicles (UAVs), and hand eye systems must tolerate vibration of its cameras and be robust against disturbances. We propose a stereo self-adjustment methodology for resuming autonomous stereo system operations. The methodology aims to achieve autonomous recovery of camera directions, even if the cameras rotate after a weak impact. In autonomous recovery, the self-adjustment procedure calculates the rotation values of rotated cameras. The camera directions of the stereo system then recover their initial directions using the rotation parameters. Moreover, we have verified the validity of our approach through experiments using an active stereo camera in which three cameras can rotate independently.
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
Authors: Chun-Lung Chen, Chuen-Lung Chen
Venue: Computers and Operations Research (2009)

This study developed a bottleneck-based heuristic (BBFFL) to solve a flexible flow line problem with a bottleneck stage, where unrelated parallel machines exist in all the stages, with the objective of minimizing the makespan. The essential idea of BBFFL is that scheduling jobs at the bottleneck stage may affect the performance of a heuristic for scheduling jobs in all the stages. Therefore, in BBFFL, a variant of Johnson's rule is used to develop a bottleneck-based initial sequence generator (BBISG). Then, a bottleneck-based multiple insertion procedure (BBMIP) is applied to the initial sequence to control the order by which jobs enter the bottleneck stage to be the same as that at the first stage. Five experimental factors were used to design 243 different production scenarios and 10 test problems were randomly generated in each scenario. These test problems were used to compare the performance of BBFFL with several well-known heuristics. Computational results show that the BBFFL significantly outperforms all the well-known heuristics.
Best value concessionaire selection through a fuzzy logic system
Authors: Xueqing Zhang
Venue: Expert Systems with Applications: An International Journal (2009)

Best value is the ultimate goal in the development of infrastructure projects through public private partnerships. This necessitates a best value approach in selecting the right private partner (i.e., the concessionaire) that involves evaluating alternative concessionaires against multiple conflicting criteria of varying degrees of importance and uncertainty. Correspondingly, this paper has developed a quantitative best value concessionaire selection system. The essence of this system lies in (1) the establishment of four-package evaluation criteria that can effectively measure the concessionaire's capability and ''predict'' its future performance toward achieving the government's best value objectives and (2) the development of a fuzzy-composite scoring and ranking method that ensures the right ''tradeoff'' between these criteria by relatively weighting fuzzy scores and logically aggregating evaluation results. This system would not only provide the government integrated assessments of alternative concessionaires so as to award the contract to the right concessionaire whose proposal is perceived to be able to maximize the outcome of the project, but also satisfy the requirements of the legal decision in order to withstand legal challenges concerning the public contract awarded in a best value approach. A hypothetical case study is provided to demonstrate the application of this best value concessionaire selection system.