ppxscal/embedding_network huggingface dataset:
Handbook of Research on Secure Multimedia Distribution, 1st edition
Authors: Shiguo Lian, Yan Zhang, Shiguo Lian, Yan Zhang
Venue: Premier Reference Source (2009)

New technologies and concepts are constantly being developed within multimedia distribution. In such an ever-evolving environment, academidans, researchers, and professionals of this discipline need access to the most current information about the concepts, issues, trends, and technologies in this emerging field. The Handbook of Research on Secure Multimedia Distribution provides the latest research on secure multimedia content distribution, embracing a wide variety of aspects and providing a scientifically and scholarly sound treatment of state-of-the-art techniques to students, researchers, and academicians interested or involved in the study, research, use, design, and development of techniques related to multimedia distribution. This title offers: 27 authoritative contributions by over 55 of the world's leading experts on secure multimedia distribution from 17 countries; comprehensive coverage of each specific topic, highlighting recent trends and describing the latest advances in the field; more than 960 references to existing literature and research on secure multimedia distribution; a compendium of over 225 key terms with detailed definitions. This title is organized by topic and indexed, making it a convenient method of reference for all IT/IS scholars and professionals. It features cross-referencing of key terms, figures, and information pertinent to secure multimedia distribution and free institution-wide access to the online version with the purchase of the print publication.
Localization with the iRobot Create
Authors: Max Kuipers
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

In this paper, I will discuss implementing the Monte Carlo Localization algorithm on the iRobot Create. This paper will explain in depth what worked and what did not work in implementing it.
Flexible Provisioning of Service Workflows
Authors: Sebastian Stein, Nicholas R. Jennings, Terry R. Payne
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Service-oriented computing is a promising paradigm for highly distributed and complex computer systems. In such systems, services are offered by provider agents over a computer network and automatically discovered and provisioned by consumer agents that need particular resources or behaviours for their workflows. However, in open systems where there are significant degrees of uncertainty and dynamism, and where the agents are self-interested, the provisioning of these services needs to be performed in a more flexible way than has hitherto been considered. To this end, we devise a number of heuristics that vary provisioning according to the predicted performance of provider agents. We then empirically benchmark our algorithms and show that they lead to a 350% improvement in average utility, while successfully completing 5--6 times as many workflows as current approaches.
Cooperative content distribution and traffic engineering in an ISP network
Authors: Wenjie Jiang, Rui Zhang-Shen, Jennifer Rexford, Mung Chiang
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

Traditionally, Internet Service Providers (ISPs) make profit by providing Internet connectivity, while content providers (CPs) play the more lucrative role of delivering content to users. As network connectivity is increasingly a commodity, ISPs have a strong incentive to offer content to their subscribers by deploying their own content distribution infrastructure. Providing content services in an ISP network presents new opportunities for coordination between traffic engineering (to select efficient routes for the traffic) and server selection (to match servers with subscribers). In this work, we develop a mathematical framework that considers three models with an increasing amount of cooperation between the ISP and the CP. We show that separating server selection and traffic engineering leads to sub-optimal equilibria, even when the CP is given accurate and timely information about the ISP's network in a partial cooperation. More surprisingly, extra visibility may result in a less efficient outcome and such performance degradation can be unbounded. Leveraging ideas from cooperative game theory, we propose an architecture based on the concept of Nash bargaining solution. Simulations on realistic backbone topologies are performed to quantify the performance differences among the three models. Our results apply both when a network provider attempts to provide content, and when separate ISP and CP entities wish to cooperate. This study is a step toward a systematic understanding of the interactions between those who provide and operate networks and those who generate and distribute content.
Improved Quantum Evolutionary Algorithm Combined with Chaos and Its Application
Authors: Jianhua Xiao
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Quantum evolutionary algorithm (QEA) has been developed rapidly and has been applied widely during the past decade. In this paper, an improved quantum evolutionary algorithm (IQEA) is presented based on particle swarm optimization (PSO) and chaos. The simulation results in solving DNA encoding demonstrate that the improved quantum evolutionary algorithm is valid and outperforms the quantum chaotic swarm evolutionary algorithm and conventional evolutionary algorithm. abstract environment.
Object separation by polarimetric and spectral imagery fusion
Authors: Y. Zhao, L. Zhang, D. Zhang, Q. Pan
Venue: Computer Vision and Image Understanding (2009)

When light is reflected from object surface, its spectral characteristics will be affected by the surface's elemental composition, and its polarimetric characteristics will be governed by the surface's roughness and conductance. Polarimetric and multispectral imaging can provide complementary discriminative information in applications such as object separation. However, few methods have been proposed to fuse the information provided by polarimetric and multispectral imagery for better object separation results. Considering that the metal and dielectric materials, and the manmade objects and natural background have different polarimetric and multispectral features, in this paper we propose a simple yet powerful method for object separation by using the polarimetric and spectral characteristics of specular and diffuse reflected light. A polarimetric imagery fusion algorithm is first proposed based on the degree of linear polarization modulation to distinguish different objects. Then the spectral and polarimetric information, which can be extracted from the specular and diffuse reflected light, is fused by using the HSI color space mapping for more robust object separation. Experiments on real outdoor and indoor images are performed to evaluate the efficiency of the proposed scheme.
A new public-key encryption scheme
Authors: Hai-Bo Tian, Xi Sun, Yu-Min Wang
Venue: Journal of Computer Science and Technology (2007)

This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme. As a result, a ciphertext is not a quadruple but a triple at the cost of a strong assumption, the third version of knowledge of exponent assumption (KEA3). Under assumptions of KEA3, a decision Diffie-Hellman (DDH) and a variant of target collision resistance (TCRv), the new scheme is proved secure against indistinguishable adaptive chosen ciphertext attack (IND-CCA2). This scheme is as efficient as Damgård ElGamal (DEG) scheme when it makes use of a well-known algorithm for product of exponentiations. The DEG scheme is recently proved IND-CCA1 secure by Bellare and Palacio in ASIACRYPT 2004 under another strong assumption. In addition to our IND-CCA2 secured scheme, we also believe that the security proof procedure itself provides a well insight for ElGamal-based encryption schemes which are secure in real world.
A new integer image coding technique based on orthogonal polynomials
Authors: R. Krishnamoorthi, N. Kannan
Venue: Image and Vision Computing (2009)

In this paper, a new image coding scheme based on orthogonal polynomials has been presented. From a set of orthogonal polynomial functions, we first obtain the polynomial operators and polynomial basis operators of different width to propose the polynomial transform coding. After applying the proposed transformation, the transform coefficients are threshold coded using quantization and bit allocation as in JPEG baseline system. The performance of the proposed transform coding is reported by computing peak signal-to-noise ratio (PSNR). The proposed coding scheme is also compared with other transform coding schemes such as Discrete Cosine Transform and Discrete Wavelet Transforms.
Adaptive Growing Quantization for 1D CMAC Network
Authors: Ming-Feng Yeh, Kuang-Chiung Chang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This study attempts to propose an adaptive growing quantization approach for one-dimensional cerebellar model articulation controller (1D CMAC) network. Even though the target function is unknown in advance, the learning error can be still acquired and then is utilized to determine whether the input space needs to be repartitioned or not. Once the input space is determined to be repartitioned, some new knots are inserted for further quantization, and then the number of the states is increased. Therefore, the proposed approach not only possesses the adaptive quantization ability in the input space, but also has the growing feature in the number of the states. Beside, the linear interpolation scheme is applied to calculate the CMAC output for simultaneously improving the generalization ability and reducing the memory requirement. Simulation results show that the proposed approach not only has the adaptive quantization ability, but also can achieve a better learning accuracy and a faster convergence speed.
High-order compact scheme for solving nonlinear Black-Scholes equation with transaction cost
Authors: Wenyuan Liao, Abdul Q. M. Khaliq
Venue: International Journal of Computer Mathematics (2009)

In this paper, an unconditionally stable high-order compact finite difference scheme is proposed. The compact scheme is fourth-order accurate in both the temporal and spatial dimensions. The new method computes both the option price and the hedging delta ∂ V/∂ S simultaneously. Two numerical examples are presented to demonstrate the accuracy and efficiency of the proposed scheme.
Bridge the Gap between Software Test Process and Business Value: A Case Study
Authors: Qi Li, Mingshu Li, Ye Yang, Qing Wang, Thomas Tan, Barry Boehm, Chenyong Hu
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

For a software project to succeed, acceptable quality must be achieved within an acceptable cost, providing business value to the customers, and keeping delivery time short. Software testing is a strenuous and expensive process and is often not organized to maximize business value. In this article, we propose a practical value based software testing method which aligns the internal test process with the value objectives coming from the customers and the market. Our case study in a real-life business project shows that this method helps manage testing process effectively and efficiently.
Extracting word sets with non-taxonomical relation
Authors: Eiko Yamamoto, Hitoshi Isahara
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

At least two kinds of relations exist among related words: taxonomical relations and thematic relations. Both relations identify related words useful to language understanding and generation, information retrieval, and so on. However, although words with taxonomical relations are easy to identify from linguistic resources such as dictionaries and thesauri, words with thematic relations are difficult to identify because they are rarely maintained in linguistic resources. In this paper, we sought to extract thematically (non-taxonomically) related word sets among words in documents by employing case-marking particles derived from syntactic analysis. We then verified the usefulness of word sets with non-taxonomical relation that seems to be a thematic relation for information retrieval.
A Web-based Basic Language Tutor
Authors: Phanwoo Park, Tanja Mitrovic
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Teaching programming is an important part of the ICT education field, and helps to increase the ability of analyzing, logical thinking, and solving procedural problems. To learn how to make program, students should be able to develop programs and run them immediately on their own computers. However, this requires a compiler/interpreter to be available on the local machine, which is not always possible. We developed a Web-based educational environment for the Basic language, which includes an interpreter so that students' programs can be executed on the server. This way, students can develop, edit and run programs over the Internet even if they do not set up the language translator program on their local computers.
Logic Profiling for Multicriteria Rating on Web Pages
Authors: Alessandra Mileo
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

I want to propose a general framework for user-oriented and content-based recommender systems aimed at providing preferential multicriteria rating on Web Pages and automatic user's profile generation and updating through logic programming techniques.
Evolutionary, not revolutionary, programming exercises using design patterns in an OO data structures course
Authors: Ron Zucker, Albert Ritzhaupt
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Over the years there have been many papers supporting the use of design patterns in a traditional data structures course. In support of this approach, we present an evolutionary sequence of five programming exercises, concentrating on problems that require the use of six different design patterns in the context of a data structures course. Included with these exercises are brief descriptions, code segments, and teaching tips to demonstrate the simplicity and power of design patterns to teach object-oriented design principles. UML class diagrams are used to visualize and supplement the discussions.
Knowledge Based Systems in Industry --Ontology Pays Half the Rent
Authors: Wernher Behrendt
Venue: Proceeding of the 2008 conference on Formal Ontologies Meet Industry (2008)

We argue that unless the use of formal ontology becomes part and parcel of Systems Engineering culture, industrial use of knowledge based systems will remain a fringe activity and consequently, success stories will remain scarce. The way towards reaping the benefits of formal ontology is to view it as the most powerful instrument for sustainable standardization and as a necessary but not sufficient, condition for building knowledge based systems. Foundational ontology may become the conceptual backbone of all interoperable systems, but it will only realize its potential when it is backed by ontology engines that compute ontological meaning from ontological descriptions. The paper charts the way from organizational practice expressed in ontologies, to the engineering discipline of building knowledge based systems and it illustrates the difficulties by some lessons learned in a semi-industrial research context in the field of mechatronics.
Computer network routing based on imprecise routing tables
Authors: Milan Tuba
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

This paper examines problems that arise from the fact that dynamic routing never relies on the precise, current information about the network state. It is a normal expectation that dynamic routing has to give better results than a static one. However, it takes some time to collect information about the network current state, and optimization is always done with that imprecise information. This situation is examined by a complete mathematical analysis of a simple network. We show that dynamic routing gives better results than static, as expected, but that the margin is much smaller then intuitively expected. Further analysis shows that that minor advantage can easily be lost if there is even a small error in the dynamic routing tables, and actually dynamic routing can easily become worse than static. Quantitative analysis shows that delays in building routing tables can affect dynamic routing performance unexpectedly strongly. The conclusion is that dynamic routing should not try to adapt to traffic changes very fast.
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Authors: Mark Burgin, Eugene Eberbach
Venue: Fundamenta Informaticae (2009)

The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata considered in this paper are evolutionary Turing machines and evolutionary inductive Turing machines. Various subclasses and modes of evolutionary computation are defined. Problems of existence of universal objects in these classes are explored. Relations between Turing machines, inductive Turing machines, evolutionary Turing machines, and evolutionary inductive Turing machines are investigated.
A document protection scheme using innocuous messages as camouflage
Authors: Ching-Sheng Hsu, Shu-Fen Tu, Young-Chang Hou
Venue: WSEAS Transactions on Information Science and Applications (2009)

Lin and Lee proposed a document protection scheme which utilized a meaningful document to cover the secret document. Although some researchers extended and improved their scheme, the main drawbacks of Lin and Lee's scheme are still left unsolved. The aim of our study is to propose a new document protection scheme to solve these drawbacks. Instead of encoding the secret codes into index numbers, we generate the cipher message through a series of comparisons between cheating codes and the logic operator XOR. Compared with other studies, ours have the following advantages: firstly, the selection of the cheating document needs not to be restricted to the character set of the secret document; secondly, the length of the encoded file is the same as that of the secret document; thirdly, the codes of the cipher message are almost uniformly distributed so is difficult to analyze without the key; fourthly, with the help of inner codes, our scheme is applicable to documents in any languages; finally, our scheme performs efficiently and is easy to implement.
Homogeneous distributed control systems: a model of code generation
Authors: Kujtim Hyseni, Lavdim Kurtaj, Ilir Limani
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

Communication between data acquisition and control systems has always been a concern. Other important issue is building large, integrated, scalable systems. This is due to consisting modules incompatibility. We focus our work on tiny devices, such are microcontrollers, mobile phones, and like; target platform is Corba/e. Intention is making trivial generation of environment specific optimized code for Corba clients and servers. It addresses resource limited devices rather than standard ones which generate code for large, resource rich, PC like architectures; they are typically language oriented. We define a modified version of attributed grammar file with Coco/R which contains parsing rules and language specific mappings as well as template target file.
Cyberspace Security and Defense: Research Issues Proceedings of the NATO Advanced Research Workshop on Cyberspace Security and Defense Research Issues, ... II Mathematics, Physics and Chemistry), 1st edition
Authors: Janusz S. Kowalik, Janusz Gorski, Anatoly Sachenko
Venue:  (2009)

Cyberspace security is a critical subject of our times. On one hand the development of Internet, mobile communications, distributed computing, computer software and databases storing essential enterprise information has helped to conduct business and personal communication between individual people. On the other hand it has created many opportunities for abuse, fraud and expensive damage. This book is a selection of the best papers presented at the NATO Advanced Research Workshop dealing with the Subject of Cyberspace Security and Defense. The level of the individual contributions in the volume is advanced and suitable for senior and graduate students, researchers and technologists who wish to get some feeling of the state of the art in several sub-disciplines of Cyberspace security. Several papers provide a broad-brush description of national security issues and brief summaries of technology states. These papers can be read and appreciated by technically enlightened managers and executives who want to understand security issues and approaches to technical solutions. An important question of our times is not "Should we do something for enhancing our digital assets security", the question is "How to do it".
Flexible, wide-area storage for distributed systems with WheelFS
Authors: Jeremy Stribling, Yair Sovran, Irene Zhang, Xavid Pretzer, Jinyang Li, M. Frans Kaashoek, Robert Morris
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

WheelFS is a wide-area distributed storage system intended to help multi-site applications share data and gain fault tolerance. WheelFS takes the form of a distributed file system with a familiar POSIX interface. Its design allows applications to adjust the tradeoff between prompt visibility of updates from other sites and the ability for sites to operate independently despite failures and long delays. WheelFS allows these adjustments via semantic cues, which provide application control over consistency, failure handling, and file and replica placement. WheelFS is implemented as a user-level file system and is deployed on PlanetLab and Emulab. Three applications (a distributed Web cache, an email service and large file distribution) demonstrate that WheelFS's file system interface simplifies construction of distributed applications by allowing reuse of existing software. These applications would perform poorly with the strict semantics implied by a traditional file system interface, but by providing cues to WheelFS they are able to achieve good performance. Measurements show that applications built on WheelFS deliver comparable performance to services such as CoralCDN and BitTorrent that use specialized wide-area storage systems.
StoryTime: a new way for children to write
Authors: Alex Kuhn, Chris Quintana, Elliot Soloway
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

The StoryTime project explores the benefits of and issues surrounding the use of mobile finger-touch devices to support struggling writers. StoryTime is a mobile finger-touch tool designed from a learner-centered design perspective to be a supportive writing tool for children 7--9 years old. StoryTime allows children to write stories by providing simpler writing mechanics, increased user engagement, and a contextualized writing experience. The combination of these attributes allows struggling writers to focus more on the sentence construction task. Here we describe the iterative design and testing of three versions of StoryTime on 13 children to date.