ppxscal/embedding_network huggingface dataset:
Software project management: analysis of engineering and management processes by simulation of stochastic system of graphical printing industry production
Authors: Vladimir Simovic
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Proper and effective Software Project Management is usually the most important factor in the outcome of a project for many companies in modern graphical printing industry production and their project engineers and managers [2]. Article opens new analytical directions for proper management of the software project in modern graphical printing industry production, which can be one of the important reasons for success. By using effective project management techniques a project manager can improve the chances of success in graphical printing production. Problem is how to analytically combine these techniques into a practical and best effective workable process? For effective solution one need a balanced process that covers the management and production of the entire project from inception to completion.
A general theorem for adjacency matrices of graph products and application in graph partitioning for parallel computing
Authors: A. Kaveh, B. Alinejad
Venue: Finite Elements in Analysis and Design (2009)

Many regular models can be viewed as the graph products of two ore more subgraphs know as their generators. In this paper, a general theorem is presented for the formation of adjacency matrices using a series of algebraic relationships. These operations are performed on the adjacency matrices of the generators. The Laplacian matrix of the graph product is then formed and the second eigenvalue and the corresponding eigenvector are used for the bisection of the regular graphs associated with space structures or finite element models.
Adaptive Augmented Reality Using Context Markup and Style Maps
Authors: Erick Mendez, Dieter Schmalstieg
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Augmented Reality (AR) enables users to visualize synthetic information overlaid on top of real imagery. Such visualization may be achieved by tools that distort, filter or enhance the explored information. However, little to no work has focused on the separation of style definitions and their mapping to scene objects. We target this separation based on a context rich scenegraph. Our research allows the definition of visualization styles independent on the data to be visualized.
Realization of distributed remote laboratory and remote debug software for embedded system
Authors: Yin Wei-feng, sun Rong-gao, Wan Zhong
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

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. Distributed architecture is presented using Web Services technique to share laboratories resource for multi-user. A design of ARM debugging interface based on JTAG is given. This debugging interface has been used for remote debugging to build embedded system remote laboratory. A Integrated learning environment for remote experimentation for embedded system is provided for convenient learning by students self.
A Method Using Genetic Algorithm to Optimize Neural Networks Applied in Sustainable Development Ability Appraisal
Authors: Meng-jia Zeng, Zhao-lin Cheng
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents a method using genetic algorithms to optimize neural networks. It handled the problem of neural network early-maturing. Then it established an appraisal model of sustainable development ability and it's indicator system, using the method to appraisal city ability of sustainable development can solute the deficiency of subjectivity and lacking permit in the traditional estimate system. Finally, demonstration researches are carried out by use of actual index data. There is a favorable result.
On the Use of Histograms for Image Retrieval
Authors: Roberto Brunelli, Ornella Mich
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper analyzes the use of histograms of low-level image features, such as color and luminance, as descriptors for image retrieval purposes. The discrimination ability of several descriptors, the issues of histogram size and comparison, are considered in a common statistical framework.
Application generators: a case study
Authors: James H. Waldrop
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Hamilton Brothers Oil Company recently implemented a complex accounting and finance system. This system contains 157 reports, 53 online screens, and 1,320 data elements. The system was designed, developed, and implemented in 20 months. Most of the approximately 300 programs contained in this system were developed with an application generator. Using an application generator allowed the project team to complete the coding and unit testing in three months. Based upon the experience acquired in this effort, many benefits appear to be gained by using an application generator in the system development process. These include reduced coding, faster testing, and enforced structured development. However, these benefits must be weighed against the constraints associated with an application generator. These include potential file and processing inefficiencies, limited language syntax, and minimal debugging facilities.
FPGA Design Productivity --- A Discussion of the State of the Art and a Research Agenda
Authors: Brent Nelson
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

As we near 20 years of history with reconfigurable computing there is continued (and even increasing) interest in design productivity for RC. Configurable computing machines (CCMs) based on FPGAs are touted as re-usable, re-configurable platforms for accelerated computing, but the fact remains that FPGAs are simply not that easy to "program", even after all this time. Why? The usual list of suspects is familiar to most, and includes challenges with timing closure, gate-level design, fixed-point arithmetic analysis, communication management, and clock cycle level control of design resources, to name a few.To address these problems there continues to be much research in the community on higher-level languages, reusable core libraries, improved CAD tools, debug infrastructure, etc. While these research activities focus almost exclusively on CAD, there are other interesting and often overlooked pieces of the productivity puzzle. One such puzzle piece is circuit and architectural support for design productivity. Another puzzle piece poses the question: how is the RC landscape changing with the introduction of new devices (many/multi-core and coarse grain)? A final consideration is to look at the entire design productivity picture -- if all the puzzle pieces were fit together into a comprehensive approach for improving productivity, is a 10× increase feasible? 20×? If so, at what cost?This talk will focus on the above questions in the context of design productivity for FPGA application development, introducing the productivity problem, and identifying select issues which are key to providing radical design productivity improvements. It will then drill down on those key issues, showing the range of improvements possible using recently published and unpublished research results from a variety of venues.
Collaborative conceptualisation: towards a conceptual foundation of interoperable electronic product catalogue system design
Authors: Jingzhi Guo
Venue: Enterprise Information Systems (2009)

The maintenance of semantic consistency between numerous heterogeneous electronic product catalogues (EPC) that are distributed, autonomous, interdependent and emergent on the Internet is an unsolved issue for the existing heterogeneous EPC integration approaches. This article attempts to solve this issue by conceptually designing an interoperable EPC (IEPC) system through a proposed novel collaborative conceptualisation approach. This approach introduces collaboration into the heterogeneous EPC integration. It implies much potential for future e-marketplace research. It theoretically answers why real-world EPCs are so complex, how these complex EPCs can be explained and articulated in a product map theory for heterogeneous EPC integration, how a semantic consistency maintenance model can be created to satisfy the three heterogeneous EPC integration conditions and implemented by adopting a collaborative integration strategy on a collaborative concept exchange model, and how this collaborative integration strategy can be realised on a collaboration mechanism. This approach has been validated through a theoretical justification and its applicability has been demonstrated in two prototypical e-business applications.
Dealing with label switching in mixture models under genuine multimodality
Authors: Bettina Grün, Friedrich Leisch
Venue: Journal of Multivariate Analysis (2009)

The fitting of finite mixture models is an ill-defined estimation problem, as completely different parameterizations can induce similar mixture distributions. This leads to multiple modes in the likelihood, which is a problem for frequentist maximum likelihood estimation, and complicates statistical inference of Markov chain Monte Carlo draws in Bayesian estimation. For the analysis of the posterior density of these draws, a suitable separation into different modes is desirable. In addition, a unique labelling of the component specific estimates is necessary to solve the label switching problem. This paper presents and compares two approaches to achieve these goals: relabelling under multimodality and constrained clustering. The algorithmic details are discussed, and their application is demonstrated on artificial and real-world data.
Investigation of the effect of growth interruption on the formation of InAs/GaAs quantum dot superlattice near the InAs critical thickness
Authors: R. J. Kashtiban, U. Bangert, M. Missous
Venue: Microelectronics Journal (2009)

Two kinds of superlattices (i) with and (ii) without growth interrupt (GI) after deposition of 1.77 monolayers (ML) of InAs on GaAs (001) were grown by solid-source molecular beam epitaxy (MBE) and assessed by transmission electron microscopy (TEM) techniques, double crystal X-ray diffraction (DCXRD) and photoluminescence (PL) measurements in order to gain an understanding of the structural and compositional properties. In case (i) formation of coherent dislocation free self-organized quantum dots (SOQDs) with 2.8-3.2nm height and 13-16nm lateral size was observed, whereas in case (ii) no quantum dots had formed. In order to better understand the implication of growth interruption for the formation mechanism, highly localised assessment of the composition of the QD was carried out via atomic resolution Z-contrast imaging and electron energy loss spectroscopy (EELS).
Demonstration of highly programmable downlink OFDMA (WiMax) transceivers for SDR systems
Authors: Hamid Eslami, Gaurav Patel, Chitaranjan P. Sukumar, Sang V. Tran, Ahmed M. Eltawil, Raghu Rao, Chris Dick
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

In this paper, we present the architecture of a highly configurable multi-input multi-output (MIMO) orthogonal frequency division multiple access (OFDMA) platform. The platform is designed to support experimentation with various communication algorithms, thus allowing an intimate understanding of the performance of complex algorithms under real-life constraints. The hardware used is the wireless open access research platform (WARP) which facilitates rapid prototyping utilizing the FPGA and multi radio interfaces available.
Improving Throughput of AES-GCM with Pipelined Karatsuba Multipliers on FPGAs
Authors: Gang Zhou, Harald Michalik, László Hinsenkamp
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Two main components in AES-GCM (Advanced Encryption Standard with Galois Counter Mode) are an AES engine and a finite field multiplier over GF(2128) in the universal hashing function (GHASH). Because of the inherent computation feedback, the system performance is usually determined by the finite field multiplier based on the known FPGA implementations to date. In this paper, we present the throughput optimization of AES-GCM with a 4-stage pipelined finite field multiplier based on Karatsuba-Ofman algorithm on FPGAs. The critical delay of the pipelined multiplier then matches that of the AES implementation with either the BlockRAM SubBytes, pipelined composite field SubBytes or LUT-based SubBytes. The AES-GCM throughput reaches more than 30Gbps on a single Xilinx Virtex Chip. The experimental results show that we achieve the most efficient AES-GCM implementations on FPGAs to date.
Spatial and temporal design debug using partial MaxSAT
Authors: Yibin Chen, Sean Safarpour, Andreas Veneris, Joao Marques-Silva
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Design debug remains one of the major bottlenecks in the VLSI design cycle today. Existing automated solutions strive to aid engineers in reducing the debug effort by identifying possible error sources in the design. Unfortunately, these techniques do not provide any information regarding the time at which the bug is active during an error trace or counter-example. This work introduces an automated debug technique that provides the user with both spatial and temporal information about the source of error. The proposed method is based on a Partial MaxSAT formulation which models errors at the CNF clause level instead of the traditional gate or module level. Thus, error sites are identified based on erroneous implications that correspond to locations both in the design and in the error trace. Experiments demonstrate that we can provide this additional information at no extra cost in run time and are able to prune about 61% of all simulation time frames from the debugging process. When compared to a trivial formulation we observe a performance improvement of up to two orders of magnitude and 5× on average when using the proposed formulation.
A computational study of ruled surfaces
Authors: Laurent Busé, Mohamed Elkadi, André Galligo
Venue: Journal of Symbolic Computation (2009)

We study rational ruled surfaces and @m-bases which were recently considered in a series of articles by Chen and coworkers. We give short and conceptual proofs with geometric insights and efficient algorithms. In particular, we provide a method to reparameterize an improper parameterization and we also briefly explain how to deal with approximate input data. Finally we provide an algorithmic description of self-intersection loci.
Investigation of genetic algorithms contribution to feature selection for oil spill detection
Authors: K. Topouzelis, D. Stathakis, V. Karathanassi
Venue: International Journal of Remote Sensing (2009)

Oil spill detection methodologies traditionally use arbitrary selected quantitative and qualitative statistical features (e.g. area, perimeter, complexity) for classifying dark objects on SAR images to oil spills or look-alike phenomena. In our previous work genetic algorithms in synergy with neural networks were used to suggest the best feature combination maximizing the discrimination of oil spills and look-alike phenomena. In the present work, a detailed examination of robustness of the proposed combination of features is given. The method is unique, as it searches though a large number of combinations derived from the initial 25 features. The results show that a combination of 10 features yields the most accurate results. Based on a dataset consisting of 69 oil spills and 90 look-alikes, classification accuracies of 85.3% for oil spills and in 84.4% for look-alikes are achieved.
A Perceptual Quality Metric for Performance Evaluation of Image Fusion
Authors: Muwei Jian, Ping Ma, Jianfeng Jia
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Usually, comparative evaluation by human visual inspection in image fusion is often used to assess the relative fusion performance of different fusion schemes. In this paper, a novel non-reference and quantitative quality metric is proposed to evaluate the perforamnce of the fusion algorithms objectively. Instead of using traditional error summation methods, the proposed measure is designed to reflect human’s visual perception and requires no knowledge of the ground truth. The proposed measure is based on wavelet tranform, which is easy to calculate and can implement straight-forwardly to assess the quality of the fusion image. Some commonly used fusion algorithms are performed to evaluate the effectiveness of the proposed metric. Experiments on various image types show that the measure has a significint improvement over standard measures, such as root mean squared error (RMSE) and mutual informance(MI), and coincides with subjective human visual inspection well.
Requirements in Conflict: Player vs. Designer vs. Cheater
Authors: David Callele, Eric Neufeld, Kevin Schneider
Venue: Proceedings of the 2008 Third International Workshop on Multimedia and Enjoyable Requirements Engineering - Beyond Mere Descriptions and with More Fun and Games (2008)

There are significant interactions between video game stakeholder emotional requirements and security require- ments. Counter-intuitively, some traditional security requirements are not necessarily met by the game implementation some forms of security breaches are condoned by the stakeholders (if not actually demanded by them) and the requirements engineering process must support these contradictions. We present an overview of security requirements for video games and show how stakeholder diversity introduces significant complexities to the requirements negotiation process. Our analysis of certain security threats, and their emotional motivations, shows that these motivations form an important element of the emotional requirements and that significant context is necessary for properly capturing the emotional requirements related to security. Finally, we show how emotional requirements can be used to guide security goal development for this domain and pro- pose the use of in-game justice systems to allow players to address security violations in realtime. Keywords: Non-functional requirements, emotion, emo- tional requirements, security, security requirements, video game.
An adaptive architecture of applying vulnerability analysis to IDS alerts
Authors: Xuejiao Liu, Xin Zhuang, Debao Xiao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

With increasing intrusions and attacks on the Internet, there is an urgent need to develop techniques for network security. Current standalone network security products, such as the firewall systems, the Intrusion Detection System (IDS), the anti-virus software, the vulnerability scanning software are not capable of withstanding the onslaught of various network threats. As a result, new security paradigms, which integrate some security devices closely to provide accurate alerts and attain enhanced protection are emerging. In order to achieve better network security, in this paper we present an adaptive architecture of applying vulnerability analysis for multiple detection sensors to detect network intrusions. The architecture is designed as a layer above intrusion detection aimed at classifying the alerts overload with different severity by correlating results from multiple sensors and integrating vulnerability analysis. Intrusion Detection produces basic alerts for further evaluation, whereas vulnerability analysis provides important information to help identify the alerts. At the same time, the whole process is made more efficient and effective by using predicate-based evaluation.
Adaptive improved natural gradient algorithm for blind source separation
Authors: Jian-Qiang Liu, Da-Zheng Feng, Wei-Wei Zhang
Venue: Neural Computation (2009)

We propose an adaptive improved natural gradient algorithm for blind separation of independent sources. First, inspired by the well-known backpropagation algorithm, we incorporate a momentum term into the natural gradient learning process to accelerate the convergence rate and improve the stability. Then an estimation function for the adaptation of the separation model is obtained to adaptively control a step-size parameter and a momentum factor. The proposed natural gradient algorithm with variable step-size parameter and variable momentum factor is therefore particularly well suited to blind source separation in a time-varying environment, such as an abruptly changing mixing matrix or signal power. The expected improvement in the convergence speed, stability, and tracking ability of the proposed algorithm is demonstrated by extensive simulation results in both time-invariant and time-varying environments. The ability of the proposed algorithm to separate extremely weak or badly scaled sources is also verified. In addition, simulation results show that the proposed algorithm is suitable for separating mixtures of many sources (e.g., the number of sources is 10) in the complete case.
Optimized call admission control in wireless networks
Authors: Shengdong Xie, Meng Wu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Traditional traffic rate regulation/degradation schemes in call admission control (CAC) seldom take rate degradation optimization into consideration, thus can not obtain the perfect grade of service (GoS) in session layer. In this paper, we propose an enhanced rate degradation CAC (ERDCAC) scheme in multimedia wireless networks, which is an extension and optimization of the rate regulation CAC scheme. We introduce a variable which is a degradation threshold for wide-band traffic (WB) when new narrow-band (NB) connection arrives, and can be adjusted at the start of every monitor period. We develop a Markov model to analyze the ERDCAC, and design a cost function to evaluate its performance. From the result of Markov model analysis, along with the measurements of call arrival rates of all traffics, the threshold variable to acquire the best GoS is obtained. Extensive numeric results illustrate the effectiveness of the ERDCAC compared with traditional rate regulation CAC scheme which is a non-optimization rate degradation scheme.
Storage technology
Authors: Glen C. Bacon
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The sessions on storage provide a review of recent activity in mass storage along with an update on the several technologies which are contending for a place in the storage hierarchy. These two sessions are complemented by two sessions concerned with systems and reliability aspects. On the latter issue, the application of algebraic coding theory to both data transmission and data storage is investigated. An extensive piece of theoretical and experimental work is reported and hardware implications for mass storage are considered. 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