ppxscal/embedding_network huggingface dataset:
Comparative analysis of multi-agents competing for trading agents competition
Authors: Stefan Udristoiu, Bogdan Lapadat, Ecaterina Manole
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

We present a comparative analysis for several multi-agents participating in Trading Agents Competition, Classic. The game is first partitioned into separate modules, for which distinct strategies may be developed. The strategies used are taken into consideration both individually and in relation with other agents, but also the game medium. Conclusions regarding possible improvements, better strategies and potential weaknesses are driven from each agent analysis. Alternatives like static market algorithms vs. dynamic market algorithms are considered in detail and advantages and disadvantages are discussed. Also a discussion of TAC market and possibilities for the stochastic system approximation with a deterministic one is realized.
A secure identity-based threshold signature scheme from Tate pairings
Authors: Hong Zhou, Xi Li, Jie Yang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Identity-based systems have the property that a user's public key can be easily calculated from his identity by a publicly available function. The bilinear pairings, especially Tate pairings, have high performance in cryptography. With the foundation of above two properties, we have proposed a new ID-Based (t,n) threshold signature scheme from Tate pairings. The scheme is proved secure that it can resist attacks including plaintext attack, recovery equation attack, conspiracy attack and impersonation attack. Furthermore, performance analysis shows that the proposed scheme is simple, efficient so that it will be suitable for an environment of finite bandwidth and low capability equipment.
Development of telecommunication and broadcasting infrastructure indices at the global level
Authors: Adnan Al-mutawkkil, Almas Heshmati, Junseok Hwang
Venue: Telecommunications Policy (2009)

The importance of information and communication technology (ICT) in economic development has been increasing rapidly along with the Internet and mobile telecommunication networks. ICT development is becoming a main growth factor of many countries. As they realize the importance of the ICT industry, developing nations work to catch up with established economies. Therefore, many nations are formulating an ICT-enhanced policy. This paper introduces a number of telecommunication and broadcasting sub-indices, which include the fixed telephone network, the Internet, and mobile networks, which are aggregated into a composite Telecommunication Index (TI). The indices are computed using principal component analysis and human development type index methods. The country rankings, by different ICT-related indices, help identify the strengths and weaknesses of infrastructure development such that each country can foster economic growth. The performance of TI is compared with several other indices, such as the digital access, human development, and ArCo technology indices. The type of indices affects the country ratings. Results suggest that the parametric index approach may be preferred over those methods in which the subjective weighted summation of normalized variables used (non-parametric indices).
Dynamic Coverage Based on Neural Gas Learning Algorithm for Wireless Sensor Network
Authors: Yanjing Sun, Jiansheng Qian, Li Li
Venue: International Journal of Distributed Sensor Networks (2009)

With the rapid development of microelectro mechanical systems (MEMS), wireless communications, and information networking and integrated circuits technologies, wireless sensor network technology came into being. For the monitoring of large areas or dangerous region or enemy region, commonly used, such as randomly dropping the sensor nodes, and coverage is one of the main problems to solve for the WSN. Control of the coverage for WSN, can be seen as when the energy of sensor network nodes, wireless communications network bandwidth, network computing ability are limited, through placing the sensor nodes and choosing routing at the network and other means to optimize the allocation of resources of WSN, avoid blind spots in the coverage area, or get in a local minimum value. Covering algorithm needs to consider network connectivity, energy efficiency, dynamics of the network, and other issues. According to the configuration of wireless sensor nodes, coverage is divided into certainty coverage and random coverage. In the actual environment, network topology is unpredictable, and network topology changes complexly, so it seems particularly important to achieve a dynamic coverage. It is a NP problem to achieve optimal coverage for monitoring the area of unfixed and intensive signals, so we made an effective distributed approximation algorithm to ensure that the sensor nodes change rapidly to achieve optimal coverage. Assuming each sensor node can directly communicate with other nearby sensors, have the same sensing range, and have data-processing functions, and move free according to the “order” of the nodes surrounding. Assume that each sensor can know its position, and the positioning algorithm has been adopted. Using a neural network algorithm can solve the nodal redistribution problem of WSN according to the detected region changes. In the artificial neural network, the learning algorithm can be divided into erection and growth structure learning algorithm. Growth learning algorithm starts training from a small network structure, then gradually increases until it achieves the final request. We choose the GNG algorithm, and the improved GNG-U algorithm which is improved on the basis of the GNG algorithm. To the nonstationary input signal, if the distribution suddenly changes, using the algorithm can quickly delete unused nodes, effect nodes will unite together fast, and redistribution, reduce redundant nodes finally reach optimal coverage rapidly. Combine the improved GNG-U algorithm with wireless sensor network, the network can rapidly re-coverage the target region especially for special environments. The simulation results show that, compared with the growing neural gas algorithm, the GNG-U and improve GNG-U algorithm can reduce redundant nodes, improve mobility of the network, accelerate the rate of convergence, and arrive at the optimal re-coverage dynamically.
A CAPTCHA system for Nintendo DS
Authors: Mohammad Shirali-Shahreza, Sajad Shirali-Shahreza
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

In some websites, it is necessary to distinguish between human users and computer programs which is known as CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart). CAPTCHA methods are mainly based on the weaknesses of OCR systems while using them are undesirable to human users and cannot be used in some devices such as devices without keyboard. Nintendo DS is a popular handheld game console which was released in 2004. Nowadays, facilities such as the Internet connection are added in new game consoles and they are not merely used for playing games. Nintendo DS is also capable of connecting to the Internet by using the Nintendo DS Browser. But Nintendo DS Browser has some limitations such as no support for Adobe Flash. Therefore we cannot use the available CAPTCHA methods on the Nintendo DS. In this paper a new CAPTCHA system based on Online Collage CAPTCHA is designed for Nintendo DS Game console. This project has been implemented by PHP scripting language.
Approximating minimum-power edge-covers and 2,3-connectivity
Authors: Guy Kortsarz, Zeev Nutov
Venue: Discrete Applied Mathematics (2009)

Given a graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider several fundamental undirected network design problems under the power minimization criteria. The Minimum-Power Edge-Cover (MPEC) problem is: given a graph G=(V,E) with edge costs {c(e):e@?E} and a subset S@?V of nodes, find a minimum-power subgraph H of G containing an edge incident to every node in S. We give a 3/2-approximation algorithm for MPEC, improving over the 2-approximation by [M.T. Hajiaghayi, G. Kortsarz, V.S. Mirrokni, Z. Nutov, Power optimization for connectivity problems, Mathematical Programming 110 (1) (2007) 195-208]. For the Min-Powerk-Connected Subgraph (MPkCS) problem we obtain the following results. For k=2 and k=3, we improve the previously best known ratios of 4 [G. Calinescu, P.J. Wan, Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks, Mobile Networks and Applications 11 (2) (2006) 121-128] and 7 [M.T. Hajiaghayi, G. Kortsarz, V.S. Mirrokni, Z. Nutov, Power optimization for connectivity problems, Mathematical Programming 110 (1) (2007) 195-208] to 323 and 523, respectively. Finally, we give a 4r"m"a"x-approximation algorithm for the Minimum-Power Steiner Network (MPSN) problem: find a minimum-power subgraph that contains r(u,v) pairwise edge-disjoint paths for every pair u,v of nodes.
Disk striping in video server environments
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: A growing number of applications need access to video data stored in digital form on secondary storage devices (e.g., video-on-demand, multimedia messaging). As a result, video servers that are responsible for the storage and retrieval, at fixed rates, of hundreds of videos from disks are becoming increasingly important. Since video data tends to be voluminous, several disks are usually used in order to store the videos. A challenge is to devise schemes for the storage and retrieval of videos that distribute the workload evenly across disks, reduce the cost of the server and at the same time, provide good response times to client requests for video data. We present schemes that are based on striping videos (fine-grained as well as coarse-grained) across disks in order to effectively utilize disk bandwidth. The proposed schemes are starvation-free and provide good response times to client requests. For the schemes, we show how an optimal-cost server architecture can be determined if data for a certain prespecified number of videos is to be concurrently retrieved. Finally, through extensive simulations, we compare the performance of the various schemes.
Electronic governance act
Authors: Plamen Vachkov, Roumen Trifonov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

This paper presents the basic principles of the Bulgarian Electronic Governance Act and the regulation of the obligations for interoperability and information security
Paintshop, odd cycles and necklace splitting
Authors: Frédéric Meunier, András Seb
Venue: Discrete Applied Mathematics (2009)

The following problem has been presented in [T. Epping, W. Hochstattler, P. Oertel, Complexity results on a paint shop problem, Discrete Applied Mathematics 136 (2004) 217-226] by Epping, Hochstattler and Oertel: cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color changes. More generally, the ''paint shop scheduling problem'' is defined with an arbitrary multiset of colors given for each car, where this multiset has the same size as the number of occurrences of the car; the mentioned article states two conjectures about the general problem and proves its NP-hardness. In a subsequent paper in [P. Bonsma, Th. Epping, W. Hochstattler, Complexity results for restricted instances of a paint shop problem for words, Discrete Applied Mathematics 154 (2006) 1335-1343], Bonsma, Epping and Hochstattler proved its APX-hardness and noticed the applicability of some classical results in special cases. We first identify the problem concerning two colors as a minimum odd circuit cover problem in particular graphs, exactly situating the problem. A resulting two-way reduction to a special minimum uncut problem leads to polynomial algorithms for subproblems, to observing APX-hardness through MAX CUT in 3-regular graphs, and to a solution with at most 3/4th of all possible remaining color changes (when all obliged color changes have been made). For the general problem concerning an arbitrary number of colors, we realize that the two aforementioned conjectures are corollaries of the celebrated ''necklace splitting'' theorem of Alon, Goldberg and West.
On Privacy Protection in Biometric Passports
Authors: György Kálmán, Josef Noll
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper we investigate issues related to biometric passports. First an overview of the current system is given. Then we present weaknesses associated with the hash functions designed for binary data used on bitmaps. After we show the possibility to use watermarking technologies to avoid storing the fingerprint in the passport but retaining the fingerprint check function.
Curved space optimization for allocation of SVC in a large power system
Authors: Feraidoon Farrahi-Moghaddam, Hossein Nezamabadi-pour, Malihe M. Farsangi
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper investigates the ability of a new heuristic optimization method known as Curved Space Optimization (CSO) to deal with optimal placement of Static Var Compensators (SVCs) in a large power system based on its primary function, where the optimization is made on two parameters: its location and size. The primary function of a SVC is to improve transmission system voltage, thereby enhancing the maximum power transfer limit. To validate the results obtained by CSO, Particle Swarm Optimization (PSO) Algorithm is applied. The results show CSO finds the optimal solution in finding the location and size of SVC.
Aggregation of Information Resources on the Invisible Web
Authors: Gang Li, Guangzeng Kou
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

There are huge numbers of valuable information resources resided on Invisible Web. However, it is hard to use for us. In this paper we propose a system called NewsReaper that is capable of making Invisible Web to be visible, especially the huge number of real-time information, which update frequently and are time-sensitive. NewsReaper makes use of information extraction, text classification, full text index, RSS technologies to aggregate Invisible Web information resource. In first, this paper analyzes the reasons why it is invisible and four types of Invisible Web. At the same time it summarizes the characteristics of Invisible Web. On this basis, the system architecture of NewsReaper will to be introduced. In order to verify this system, there is a test for campus recruitment information compared with general-purpose search engines. Finally, the weaknesses of this system and some further works are discussed.
Performance Tradeoff in Multiuser Equalization for CDMA over Flat Channels
Authors: Kok Ann Donny Teo, Shuichi Ohno
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We study the bit-error rate (BER) for different code lengths and number of users in CDMA system with linear minimum mean squared error (MMSE) and non-linear equalizations. We first show that for a fix channel and a fix number of users, BER of each symbol after linear equalization degrades with a decrease in the code length. Then, we prove that for a fix code length, the BER averaged over random channels improves with a decrease in the number of users. Furthermore, in the non-linear serial-interference cancellation (SIC) scheme, we prove analytically that the BER improves with each step of symbol cancellation for any channel not just at high signal-to-interference noise ratio (SINR) but at all range of SINR. Simulation results are presented to substantiate our theoretical findings.
Surface Reconstruction via L1-Minimization
Authors: Veselin Dobrev, Jean-Luc Guermond, Bojan Popov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A surface reconstruction technique based on the L 1- minimization of the variation of the gradient is introduced. This leads to a non-smooth convex programming problem. Well-posedness and convergence of the method is established and an interior point based algorithm is introduced. The L 1-surface reconstruction algorithm is illustrated on various test cases including natural and urban terrain data.
Speak software and carry a strip chip
Authors: Michael Shapiro
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A short description of TI's innovative Strip Chip Architectural Topology is given. The key features of the TMS7000 8-bit Microlanguage Processor are listed, and each of the current family members is discussed briefly. The architecture of the 7000 family is reviewed with emphasis placed on those aspects which enhance its programming power. Addressing modes and other software highlights are discussed in some detail, followed by an overview of microprogramming. 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
Stochastic Optimal Control: The Discrete-Time Case
Authors: Dimitri P. Bertsekas, Steven E. Shreve
Venue: Optimization And Neural Computation Series (2007)

This research monograph is the authoritative and comprehensive treatment of the mathematical foundations of stochastic optimal control of discrete-time systems, including the treatment of the intricate measure-theoretic issues.
Blind equalization using the IRWLS formulation of the support vector machine
Authors: Marcelino Lázaro, Jonathan González-Olasola
Venue: Signal Processing (2009)

In this paper, using a common framework, we propose, analyze, and evaluate several variants of batch algorithms for blind equalization of SISO channels. They are based on the iterative re-weighted least square (IRWLS) solution for the support vector machine (SVM). The proposed methods combine the conventional cost function of the SVM with classical error functions applied to blind equalization: Sato's and Godard's error functions are included in the penalty term of the SVM. The relationship of these batch algorithms with conventional equalization and regularization techniques is analyzed in the paper. Simulation experiments performed over a relevant set of channels show that the proposed equalization methods perform better than traditional cumulant-based methods: they require a lower number of data samples to achieve the same equalization level and convergence ratio.
Letters: NN-based output feedback adaptive variable structure control for a class of non-affine nonlinear systems: A nonseparation principle design
Authors: Hongbin Du, Xiaochuan Chen
Venue: Neurocomputing (2009)

Based on non-separation principle design and the application of Implicit Function Theorem, Mean Value Theorem, neural network parametrization and a simple linear observer, a new adaptive variable structure output feedback control is addressed for a class of non-affine nonlinear systems. In the presented scheme, many restrictive conditions, such as Lipschitz assumption, SPR (strictly positive realness) condition and contracting assumption are not required with the help of neural network parametrization. One of the main purposes of this work is to find out the relationships between the design parameters for observer and controller, and how to choose these design parameters in non-separation principle way. Semi-globally uniformly ultimate boundedness for the steady-state and transient performance is provided, and simulations verify the effectiveness of the proposed scheme.
The simultaneous consecutive ones problem
Authors: Marcus Oswald, Gerhard Reinelt
Venue: Theoretical Computer Science (2009)

The standard consecutive ones problem is concerned with permuting the columns of a 0/1-matrix in such a way that in every row all 1-entries occur consecutively. In this paper we study this problem with the additional requirement that also in every column the 1-entries have to be consecutive. To achieve this column permutations have to be allowed as well. We show that the weighted simultaneous consecutive ones problem is NP-hard and consider two special cases with fixed row and column permutations where one is still NP-hard and the other one turns out to be easy.
Mobile phone usage of young adults: the impact of motivational factors
Authors: Judy van Biljon, Paula Kotzé, Karen Renaud
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

To increase marketability in a competitive and technologically evolving market designers are compelled to add new features to mobile phones. This often leads to 'featuritis' with hit-and-miss success rates. Our research goal is to find a more informed point of departure for feature addition activities that will improve design and maximise return on investment. We argue that a human motivational factor focus could provide a solid grounding for judging whether features are likely to be used, or not. In this paper we address the motivational factors that underlie mobile phone use by young adults aged between 18 and 30. We consider models for motivational factors from psychology and consumer science, as well as mobile phone usage space models, including the mobile phone usage space model (MUSM). MUSM proposes linking usage spaces to motivational factors, but does not explicitly investigate the mapping of features to the identified usage spaces. In this paper we investigate the features associated with individual MUSM usage spaces as well as the ranking of the usage spaces for our specific target group.
An enhanced ECCM method using OFCDM in WiBro system
Authors: Myung-Jin Chung, Jung-Su Han, Hyung-Jin Choi, Seok-Joong Kim
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, we propose an enhanced ECCM system by using orthogonal frequency and code division multiplexing (OFCDM) method which is applied to band adaptive modulation and coding (AMC) subchannel in IEEE 802.16e WiBro system. The proposed method can obtain not only high anti-jamming performance but also high transmission capacity by using orthogonal variable spreading factor (SF). By using extensive computer simulation, we verify that the proposed method can effectively mitigate jamming effect without any loss of the throughput performance in various jamming environments.
Algorithmic Logic + SpecVer = the Methodology for High Integrity Programming &minus; Invited Paper
Authors: Grażyna Mirkowska, Andrzej Salwicki, Oskar Swida
Venue: Fundamenta Informaticae (2008)

Our aim is to present a methodology that integrates all phases of software&iexcl;&macr;s production beginning from the specification phase, through the phase of programming and finally the phase of verification of program against its specification. The theoretical background of the methodology is algorithmic logic [8]. The environment for practical activities of this software project is a plugin SpecVer [11] extending the Eclipse development platform [2].