ppxscal/embedding_network huggingface dataset:
Image Encryption Algorithm Based on S-boxes Substitution and Chaos Random Sequence
Authors: De Wang, Yuan-Biao Zhang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

The purpose of this paper is to improve the security and the anti-errors-proliferation character of image encryption. Based on the theory of S-box in AES, we put forward a new standard algorithm. After that, by introducing the chaos random sequence, two improved image encryption algorithms were created. The method used by the first one was that a variety of S-boxes were selected for the substitution of each byte. The method used by the second one was that the encryption included multiple rounds of S-boxes substitution. In addition, the sequences of S-boxes in two algorithms were both decided by the chaos random sequence. Afterwards, we applied the three algorithms to the specific examples in order to testify the strength and the anti-errors-proliferation character of the encryption. Consequently, we have a conclusion that the new improved image encryption algorithms could effectively improve the inefficiency and the anti-errors-proliferation character of image encryption algorithm and be easy to implement.
A Light-Weight Approach to Dynamical Runtime Linking Supporting Heterogenous, Parallel, and Reconfigurable Architectures
Authors: Rainer Buchty, David Kramer, Mario Kicherer, Wolfgang Karl
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

When targeting hardware accelerators and reconfigurable processing units, the question of programmability arises, i.e. how different implementations of individual, configuration-specific functions are provided. Conventionally, this is resolved either at compilation time with a specific hardware environment being targeted, by initialization routines at program start, or decision trees at run-time. Such technique are, however, hardly applicable to dynamically changing architectures. Furthermore, these approaches show conceptual drawbacks such as requiring access to source code and requiring upfront knowledge of future system configurations, as well as overloading the code with reconfiguration-related control routines.We therefore present a low-overhead technique enabling on-demand resolving of individual functions; this technique can be applied in two different manners; we will discuss the benefits of the individual implementations and show how both approaches can be used to establish code compatibility between different heterogeneous, reconfigurable, and parallel architectures. Further we will show, that both approaches are exposing an insignificant overhead.
PuzzledSolutions and sources
Authors: Peter Winkler
Venue: Communications of the ACM (2009)

Last month (May 2009, p. 112) we posed a trio of brain teasers, including one as yet unsolved, concerning relationships among numbers.
Parameter estimation for finite mixtures of generalized partial credit models
Authors: Dimiter Tsvetkov, Lyubomir Hristov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

We consider a finite length test and assume that each item has m&ge;2 graded response categories which satisfy the Generalized Partial Credit Model (GPCM) from the Item Response Theory and also that there exist K population classes. We give a parameter estimation procedure for this finite GPCM mixture, based on the EM algorithm and test the model with simulated data. The paper contains complete derivation of the basic model formulas.
Machine learning multi-classifiers for peptide classification
Authors: Loris Nanni, Alessandra Lumini
Venue: Neural Computing and Applications (2009)

In this paper, we study the performance improvement that it is possible to obtain combining classifiers based on different notions (each trained using a different physicochemical property of amino-acids). This multi-classifier has been tested in three problems: HIV-protease; recognition of T-cell epitopes; predictive vaccinology. We propose a multi-classifier that combines a classifier that approaches the problem as a two-class pattern recognition problem and a method based on a one-class classifier. Several classifiers combined with the &#x201c;sum rule&#x201d; enables us to obtain an improvement performance over the best results previously published in the literature.
Using spreadsheets for finite state modelling
Authors: Sujit Kumar Chakrabarti, Srihari Sukumaran
Venue: Proceedings of the 2nd India software engineering conference (2009)

State based modelling is a widely used practice in the software industry. There are two methods of building state based models: either using graphical modelling tools, or using formal languages like SMV or SAL. The former method often suffers from the problem of cost, in particular, when the modelling requirements are lightweight, purchase of an elaborate modelling tool does not turn out to be cost effective. The latter method suffers from learning complexity problem. Software engineers, who write the specifications, are usually not familiar with formal languages On the other hand, a large number of software engineers find it convenient to write their specifications semi-formally using tools such as spreadsheets. We formalise the spreadsheet finite modelling language and demonstrate that it is expressive enough to capture most important notions of finite state modelling. We show that this language is sufficiently usable in terms of readability and maintainability. We also present SAL-gen, a tool that takes as an input a finite state model written in our language, and generates corresponding SAL code. This can form the basis for analysis tools such as property checkers and test generators using the existing SAL tool set.
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
Authors: Louis Ibarra
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

We present a fully dynamic graph algorithm to recognize proper interval graphs that runs in O(logn) worst case time per edge update, where n is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in O(logn) time.
Music Ontology for Mood and Situation Reasoning to Support Music Retrieval and Recommendation
Authors: Seheon Song, Minkoo Kim, Seungmin Rho, Eenjun Hwang
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper, we discuss the use of knowledge for analyzing and retrieving music contents semantically. First, we present Context-based Music Recommendation (COMUS) ontology to reason desired user emotion state from context and user preference information in the ontology. COMUS is a music dedicated ontology in OWL constructed by incorporating domain specific classes for music recommendation into the Music Ontology, which include situation, mood and musical features. More specifically, we describe the ontologies of mood and situation in music using low-level features like pitch or duration and musical factors like tempo or rhythm. Our proposed ontology defines generic as well as domain-specific concepts whose detection is important for the analysis and description of music in a specific domain. As a novelty, our ontology can express detailed and complicated relations among the music, moods and situations, enabling users to find appropriate music for the music retrieval and recommendation application. We present some of the experiments we performed as a case-study for music recommendation.
Prioritization of digital capital measures in recruiting website for the national armed forces
Authors: Chung-Chu Liu, Shiou-Yu Chen
Venue: Expert Systems with Applications: An International Journal (2009)

E-recruiting has become one of the most successful e-commerce applications as a method for quickly reaching lots of potential job seekers. The purpose of this research is to construct the digital capital measures of recruiting websites for the national armed forces. Content analysis and the fuzzy analytical hierarchy process were adopted to collect and analyze data. According to the results, the digital capital was categorized into three dimensions: Internet relational capital, Internet customer capital, and Internet service capital. For the research, 11 subdimensions were established to assess the digital capital of national armed force website. Measuring digital capital can be used to help the authorities formulate an e-recruiting strategy, providing more valuable services and customized interface for Internet users and potential job seekers.
DMP: deterministic shared memory multiprocessing
Authors: Joseph Devietti, Brandon Lucia, Luis Ceze, Mark Oskin
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

Current shared memory multicore and multiprocessor systems are nondeterministic. Each time these systems execute a multithreaded application, even if supplied with the same input, they can produce a different output. This frustrates debugging and limits the ability to properly test multithreaded code, becoming a major stumbling block to the much-needed widespread adoption of parallel programming. In this paper we make the case for fully deterministic shared memory multiprocessing (DMP). The behavior of an arbitrary multithreaded program on a DMP system is only a function of its inputs. The core idea is to make inter-thread communication fully deterministic. Previous approaches to coping with nondeterminism in multithreaded programs have focused on replay, a technique useful only for debugging. In contrast, while DMP systems are directly useful for debugging by offering repeatability by default, we argue that parallel programs should execute deterministically in the field as well. This has the potential to make testing more assuring and increase the reliability of deployed multithreaded software. We propose a range of approaches to enforcing determinism and discuss their implementation trade-offs. We show that determinism can be provided with little performance cost using our architecture proposals on future hardware, and that software-only approaches can be utilized on existing systems.
Keynote Speech: Computational Collective Intelligence and Knowledge Inconsistency in Multi-agent Environments
Authors: Ngoc Thanh Nguyen
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

It is well-known that the knowledge of a group is not the same as the union of knowledge states of the group members. Let's consider several two examples. If an agent A knows that a > b and if an agent B knows that b > c for some real numbers variables a, b and c, then together these agents know not only a > b and b > c, but also a > c. If, in another case, A knows that a &ge; b and B knows that b &ge; a then together they know also that a = b. One can then state that the power of the collective knowledge exists owing to the inconsistency of knowledge of its members.
Earth system modelling with Windows Workflow Foundation
Authors: Matthew J. Fairman, Andrew R. Price, Gang Xue, Marc Molinari, Denis A. Nicole, Timothy M. Lenton, Robert Marsh, Kenji Takeda, Simon J. Cox
Venue: Future Generation Computer Systems (2009)

The GENIE project has built a Grid-enabled Earth system modelling framework that facilitates the integration, execution and management of component models for the study of the Earth system over millennial timescales. The existing framework supports collaborative study of GENIE models across heterogeneous compute grids through scripted workflows in the Matlab environment. While the scripting approach achieves simplicity and flexibility, it suffers from an essentially passive approach to work unit management and from a heavy reliance on a central database to provide fault tolerance. The Windows Workflow Foundation (WF) technology provides a rich set of features to support the authoring and execution of workflows, tracking services that enable the monitoring of a running workflow, and state persistence services that allow workflows to be recovered and resumed upon failure. We demonstrate how the Windows Workflow Foundation has been applied to build a complementary simulation management system which provides rapid composition, event driven logic and reliable hosting of the scientific workflows while interfacing to existing infrastructure. We also describe how the adoption of WF enables the application of a number of associated technologies to provide better interoperability and accessibility for the simulation system. These improvements are demonstrated through a parametric study of the bi-stability of the oceanic thermohaline circulation in a GENIE model where the effects of a new carbon cycle are studied.
Reduction Optimal Trinomials for Efficient Software Implementation of the ηT Pairing
Authors: Toshiya Nakajima, Tetsuya Izu, Tsuyoshi Takagi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The ηT pairing for supersingular elliptic curves over GF(3m) has been paid attention because of its computational efficiency. Since most computation parts of the ηT pairing are GF(3m) multiplications, it is important to improve the speed of the multiplication when implementing the ηT pairing. In this paper we investigate software implementation of GF(3m) multiplication and propose using irreducible trinomials xm + axk + b over GF(3) such that k is a multiple of w, where w is the bit length of the word of targeted CPU. We call the trinomials “reduction optimal trinomials (ROTs).” ROTs actually exist for several m's and for typical values of w = 16 and 32. We list them for extension degrees m = 97, 167, 193, 239, 317, and 487. These m's are derived from security considerations. Using ROTs, we are able to implement efficient modulo operations (reductions) for GF(3m) multiplication compared with cases in which other types of irreducible trinomials are used (e.g., trinomials with a minimum k for each m). The reason for this is that for cases using ROTs, the number of shift operations on multiple precision data is reduced to less than half compared with cases using other trinomials. Our implementation results show that programs of reduction specialized for ROTs are 20–30% faster on 32-bit CPU and approximately 40% faster on 16-bit CPU compared with programs using irreducible trinomials with general k.
Averaged modeling of switched DC-DC converters based on spice models of semiconductor switches
Authors: Dalibor Biolek, Viera Biolková, Zdenek Kolka
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

A generalization of the model of PWM (Pulse Width Modulation) switch according to Dijk et al. [1] for averaged modeling of switched DC-DC converters is proposed. The original model by Dijk consists of controlled current and voltage sources for modeling the ideal active and passive switch. A new model, proposed in this paper, is based on the same strategy, but it takes into account the nonideal V/I characteristics of semiconductor switches. The rules for determining the parameters of controlled sources from converter state variables remain the same as in [1], but a special procedure provides for the extraction of these parameters directly from PSpice models of concrete transistors or diodes, representing the active and passive switches. The way this model is compiled allows for the influence of parasitic ESRs of the capacitors in the circuit such that the resulting equations are equivalent to the averaged state space equations. The procedure of PSpice modeling and the results of computer simulation of boost converter are shown.
An application generator based on UML specification
Authors: Krešimir Fertalj, Mario Brčic
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

This paper presents a proprietary application generator based on UML specification. The tool is designed for generating the source code in various programming languages from the same specification. The main characteristics of the existent tools are explained in brief. Main generator capabilities and merits are presented as well as an example of usage based on a relatively simple scenario.
An Efficient Hybrid Algorithm for Optimization of Discrete Structures
Authors: Amitay Isaacs, Tapabrata Ray, Warren Smith
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Presented in this paper is a hybrid algorithm for the design of discrete structures like trusses. The proposed algorithm called Discrete Structures Optimization (DSO) is based on the Evolutionary Structural Optimization (ESO) [1,2]. In DSO, material is removed from the structural elements based on the strain energy. DSO is a two stage process. First stage is the topology optimization where the elements of the structure with the least amount of strain energy are identified and eliminated. The second stage is the sizing optimization of the structure with optimum topology identified in first stage. For the continuous design variables a gradient based method is used and for the discrete design variables a genetic algorithm is used. The algorithm is tested on 2-D and 3-D discrete structures. DSO results show significant reduction in the number of finite element analysis (FEA) evaluations as compared to genetic algorithms using simultaneous topology and sizing optimization.
QuESt: a QoS-based energy efficient sensor routing protocol
Authors: Navrati Saxena, Abhishek Roy, Jitae Shin
Venue: Wireless Communications Mobile Computing (2009)

Rapid penetration of smart wireless devices and enormous growth of wireless communication technologies has already set the stage for deployment of wireless sensor networks (WSNs). While these small sensor nodes are often considered as the future of wireless communications, they also suffer from energy constraints. On the other hand, with increasing demand for real-time services in next generation wireless networks, quality-of-service (QoS)-based routing has emerged as an interesting research topic. Naturally offering some QoS-guarantee in sensor networks raises significant challenges. The network needs to cope up with battery-constraints, while providing precise QoS (end-to-end delay and bandwidth requirement) guarantee. More precisely, designing such QoS-protocols, optimizing multiple objectives, is computationally intractable. Based on the multi-objective genetic algorithm (MOGA), in this paper we propose a QoS-based energy-efficient sensor routing (QuESt) protocol that determines application-specific, near-optimal sensory-routes demand, by optimizing multiple QoS parameters, (end-to-end delay and bandwidth requirements) and energy consumption. Simulation results demonstrate that the proposed protocol is capable of discovering a set of QoS-based, near-optimal routes, even with imprecise network information. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Research and Implementation on CSCW-Based Workflow Management System
Authors: Xiufen Fu, Junfeng Hu, Shaohua Teng, Boxing Chen, Yansheng Lu
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Through managing and controlling workflow by workflow management system, computerized business processes can be achieved, and enterprises can get a method to realize better management. This paper focuses on existing workflow management system bugs in the collaboration, discusses the combinability between workflow management system and CSCW, and puts forward a work-strategy in the workflow collaboration. This paper refers to Workflow Reference Model which is designed by Workflow Management Coalition. We have designed a CSCW-based workflow management system. This system is based on a knowledge library, uses the rules and knowledge in the knowledge library to realize the workflow collaboration. This system also applies to the area of stock to effectively solve the problem that the workflows cannot work collaboratively in the current stock system.
A quadrature formula associated with a spline quasi-interpolant operator
Authors: Ana Maria Acu, Mugur Acu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper we study a new simple quadrature rule based on integrating a spline quasi-interpolant operator on a bonded interval. We also give error estimates for smooth functions.
Voice mail
Authors: Paul F. Finnigan
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

If you think 1982 brought us revolutionary advances in communications technology, then hold on to your hats---1984 is just around the corner, and the growth of the voice store and forward market will start to prove everyone was right: The voice mail race is on. There have been survivors and losers---the real winners will be the users. Vendors that don't understand the dynamics of customer acceptance and don't engineer a usable method of applying voice mail will lose the fundamental opportunities of this technology. Voice mail is not as complicated as it looks. You pick up any telephone, anywhere in the world, and record a message for someone else in your own voice. It's a new medium of communicating. Voice mail is a fast, convenient way to tell someone something when you can't reach them directly. Everyone will use voice mail. 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
New Perspectives on Computer Concepts, 10 edition
Authors: June Jamrich Parsons, Dan Oja
Venue:  (2007)

Be engaged, excited and enlightened with New Perspectives on Computer Concepts, Tenth Edition. This book has been completely updated to provide you with the latest, most in-depth information on both computer concepts and the context in which they fit into todays world. The Tenth Edition provides the most current information on computers, software, the Internet, and emerging issues and technologies. It's unique approach transforms learning concepts into a more approachable, hands-on experience that appeals to anyone, from the computer novice to the computer savvy learner.
A New Datapath Merging Method for Reconfigurable System
Authors: Mahmood Fazlali, Mohammad K. Fallah, Mahdy Zolghadr, Ali Zakerolhosseini
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Reconfigurable systems have been proved to achieve significant performance speed-up by mapping the most time-consuming loops to a reconfigurable units. Datapath merging (DPM) synthesis has identified the similarities among the Data Flow Graphs (DFGs) corresponding to the loops, and produces a single reconfigurable datapath that can be dynamically reconfigured to execute each DFG. This paper presents a new datapath merging method that produces a reconfigurable datapath with minimal area usage. At first it merges DFGs together one by one to create the reconfigurable datapath. Then it merges the functional units and interconnection units inside the reconfigurable datapath to reduce resource area usage. To do this, a new graph-based technique to merge the resources in the reconfigurable datapath is presented. We evaluate the proposed method using programs from the Media-bench benchmarks and experimental results show a decrease from 5% to 15% in reconfigurable data path resource area in comparison to previous algorithms.