ppxscal/embedding_network huggingface dataset:
Studies of a quantum scheduling algorithm and on quantum error correction
Authors: Dan C. Marinescu
Venue:  (2007)

Quantum computation has been a rich field of study for decades because it promises possible spectacular advances, some of which may run counter to our classically rooted intuitions. At the same time, quantum computation is still in its infancy in both theoretical and practical areas. Efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems can be reformulated to take advantage of quantum parallelism and entanglement leading to algorithms which show a square root speedup over their classical counterparts. This dissertation discusses a systematic way to formulate such problems and gives as an example a quantum scheduling algorithm for an R||C max problem. This thesis shows that quantum solution to such problems is not only feasible but in some cases advantageous. The complexity of the error correction circuitry forces us to design quantum error correction codes capable of correcting only a single error per error correction cycle. Yet, time-correlated errors are common for physical implementations of quantum systems; an error corrected during a certain cycle may reoccur in a later cycle due to physical processes specific to each physical implementation of the qubits. This dissertation discusses quantum error correction for a restricted class of time-correlated errors in a spin-boson model. The algorithm proposed allows the correction of two errors per error correction cycle, provided that one of them is time-correlated. The algorithm can be applied to any stabilizer code, perfect or non-perfect, and simplified the circuit complexity significantly comparing to the classic quantum error correction codes.
Microprocessor Theory and Applications with 68000/68020 and Pentium, Har/Cdr edition
Authors: Mohamed Rafiquzzaman
Venue:  (2008)

A self-contained introduction to microprocessor theory and applications This book presents the fundamental concepts of assembly language programming and system design associated with typical microprocessors, such as the Motorola MC68000/68020 and Intel? Pentium?. It begins with an overview of microprocessors--including anexplanation of terms, the evolution of the microprocessor, and typical applications--and goes on to systematically cover: Microcomputer architecture Microprocessor memory organization Microprocessor Input/Output (I/O) Microprocessor programming concepts Assembly language programming with the 68000 68000 hardware and interfacing Assembly language programming with the 68020 68020 hardware and interfacing Assembly language programming with Pentium Pentium hardware and interfacing The author assumes a background in basic digital logic, and all chapters conclude with a Questions and Problems section, with selected answers provided at the back of the book. Microprocessor Theory and Applications with 68000/68020 and Pentium is an ideal textbook for undergraduate- and graduate-level courses in electrical engineering, computer engineering, and computer science. (An instructor's manual is available upon request.) It is also appropriate for practitioners in microprocessor system design who are looking for simplified explanations and clear examples on the subject. Additionally, the accompanying CD-ROM, which contains step-by-step procedures for installing and using Ide 68k21 (68000/68020) and MASM32 / Olly Debugger (Pentium) software, provides valuable simulation results via screen shots.
How to Design Better Ontology Metrics
Authors: Denny Vrandečić, York Sure
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

You can only control what you can measure. Measuring ontologies is necessary to evaluate ontologies both during engineering and application. Metrics allow the fast and simple assessment of an ontology and also to track their subsequent evolution. In the last few years, a growing number of ontology metrics and measures have been suggested and defined. But many of them suffer from a recurring set of problems, most importantly they do not take the semantics of the ontology language properly into account. The work presented here is a principal approach to facilitate the creation of ontology metrics with the clear goal to go beyond structural metrics to proper semantic-aware ontology metrics. We have developed guidelines and a set of methodological tools based on the notions of "normalization" and "stable metrics" for creating ontology metrics. These guidelines allow the metric author to decide which properties metrics need to fulfil and to appropriately design the desired metric. A discussion of an exemplary metric (taken from literature) illustrates and motivates the issues and suggested solutions.
Quantitative Analysis on the Bullwhip Effect in a Supply Chain Using Double Moving Average and Double Exponential Smoothing Forecasts
Authors: Chuanxu Wang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In this paper, the bullwhip effect in a multistage supply chain has been analyzed using double moving average and double exponential smoothing forecasts. We find out that double exponential smoothing and double moving average forecasts can sometimes have a variance reducing effect on the supply chain. In particular, the bullwhip effect exists for positively correlated or independent and identically distributed (i.i.d) demands. However, for negatively correlated demands, bullwhip effect does not necessarily exist. In addition, our analysis shows that the order variance based on simple moving average forecast is always larger than the order variance based on double moving average forecast, and the order variance based on simple exponential smoothing forecast is always larger than the order variance based on double exponential smoothing forecast. For the independent and identically distributed (i.i.d) demands , it can be shown that the order quantity fluctuation range for double exponential smoothing is greater than that for double moving average.
L-Modified ILP Evaluation Functions for Positive-Only Biological Grammar Learning
Authors: Thierry Mamer, Christopher H. Bryant, John Mccall
Venue: Proceedings of the 18th international conference on Inductive Logic Programming (2008)

We identify a shortcoming of a standard positive-only clause evaluation function within the context of learning biological grammars. To overcome this shortcoming we propose L-modification, a modification to this evaluation function such that the lengths of individual examples are considered. We use a set of bio-sequences known as neuropeptide precursor middles (NPP-middles). Using L-modification to learn from these NPP-middles results in induced grammars that have a better performance than that achieved when using the standard positive-only clause evaluation function. We also show that L-modification improves the performance of induced grammars when learning on short, medium or long NPPs-middles. A potential disadvantage of L-modification is discussed. Finally, we show that, as the limit on the search space size increases, the greater is the increase in predictive performance arising from L-modification.
User evaluation of a market-based recommender system
Authors: Yan Zheng Wei, Nicholas R. Jennings, Luc Moreau, Wendy Hall
Venue: Autonomous Agents and Multi-Agent Systems (2008)

Recommender systems have been developed for a wide variety of applications (ranging from books, to holidays, to web pages). These systems have used a number of different approaches, since no one technique is best for all users in all situations. Given this, we believe that to be effective, systems should incorporate a wide variety of such techniques and then some form of overarching framework should be put in place to coordinate them so that only the best recommendations (from whatever source) are presented to the user. To this end, in our previous work, we detailed a market-based approach in which various recommender agents competed with one another to present their recommendations to the user. We showed through theoretical analysis and empirical evaluation with simulated users that an appropriately designed marketplace should be able to provide effective coordination. Building on this, we now report on the development of this multi-agent system and its evaluation with real users. Specifically, we show that our system is capable of consistently giving high quality recommendations, that the best recommendations that could be put forward are actually put forward, and that the combination of recommenders performs better than any constituent recommender.
Ideas Ahead of Their Time
Authors: Fred Douglis
Venue: IEEE Internet Computing (2008)

When software ideas are ahead of their time, two problems can arise. Either better hardware is needed for the software to be feasible, a new technology isn't adoptable because there's no current need for it. EIC Fred Douglis looks at examples of both problems in this installment.
Short communication: A modified ant optimization algorithm for path planning of UCAV
Authors: Chen Mou, Wu Qing-xian, Jiang Chang-sheng
Venue: Applied Soft Computing (2008)

A modified ant algorithms is presented as a fast and efficient approach for path planning of UCAV in this paper. To fleetly and reliably accomplish the air combat task, the path planning plays an extremely important role in the design of UCAV. The planned path can ensure UCAV reach the destination along the optimization path with the minimum probability of being found and the minimum energy consumed cost. Due to the big search space, the original ant algorithm can easily converge to local best solutions, and the search speed is slow. For avoiding these disadvantages, an improved ant algorithm is given and it is used to optimize path of UCAV. The modified ant algorithm can improve the speed of selection course, and decrease the probability of local best solutions. When UCAV meets the unexpected threat during its fly, it needs to revise the aforehand given path with re-planning technology. Based on the modified ant algorithm, a new method of three-dimensional real-time path re-planning is presented for UCAV. The simulation results show that this proposed path-planning scheme can obtain the optimization path which can be re-optimized when the unexpected threats appear.
A New Construction of Multivariate Public Key Encryption Scheme through Internally Perturbed Plus
Authors: Zhiwei Wang, Xuyun Nie, Shihui Zheng, Yixian Yang, Zhihui Zhang
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Public key cryptography is an important tool in our modern information society. Multivariate public key cryptosystem (MPKC) is a type of public key cryptosystem with high efficiency. In this paper, firstly, we propose a basic multivariate public key encryption scheme which is efficient but insecure. Secondly, we use the internally perturbed plus modifier to modify the basic scheme, and get a improved scheme which is secure against known types of attacks. Finally, we provide a practical implementation of the improved scheme.
Dynamic Resource Configuration & Management for Distributed Information Fusion in Maritime Surveillance
Authors: Roozbeh Farahbod, Uwe Glässer
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

We propose a highly adaptive and auto-configurable, multi-layer network architecture for distributed information fusion to address large volume surveillance challenges, assuming a multitude of different sensor types on multiple mobile platforms for intelligence, surveillance and reconnaissance. Our focus is on network enabled operations to efficiently manage and improve employment of a set of mobile resources, their information fusion engines and networking capabilities under dynamically changing and essentially unpredictable conditions. Building on realistic application scenarios adopted from the design and development of the CanCoastWatch system [1], we contend that distributed system concepts based on decentralized control mechanisms are crucial for the design of robust and scalable network enabled operations for several reasons.
Subspace KDA Algorithm for Non-linear Feature Extraction in Face Identification
Authors: Wen-Sheng Chen, Pong C Yuen, Jianhuang Lai
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Kernel discriminant analysis (KDA) method is a promising approach for non-linear feature extraction in face identification tasks. However, as a linear algorithm to address nonlinear problem, Fisher discriminant analysis (FDA) approach will not give a satisfactory performance. Moreover, FDA usually suffers from small sample size (S3) problem. To overcome these two shortcomings in FDA method, Shannon wavelet kernel based subspace FDA (SKDA) algorithm is developed in this paper. Two public databases such as FERET and CMU PIE databases are selected for evaluation. Comparing with the existing kernel based FDA-based methods, the proposed method gives superior results.
Predicting Software Fault Proneness Model Using Neural Network
Authors: Yogesh Singh, Arvinder Kaur, Ruchika Malhotra
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Importance of construction of models for predicting software quality attributes is increasing leading to usage of artificial intelligence techniques such as Artificial Neural Network (ANN). The goal of this paper is to empirically compare traditional strategies such as Logistic Regression (LR) and ANN to assess software quality. The study used data collected from public domain NASA data set. We find the effect of software metrics on fault proneness. The fault proneness models were predicted using LR regression and ANN methods. The performance of the two methods was compared by Receiver Operating Characteristic (ROC) analysis. The areas under the ROC curves are 0.78 and 0.745 for the LR and ANN model, respectively. The predicted model shows that software metrics are related to fault proneness. The models predict faulty classes with more than 70 percent accuracy. The study showed that ANN method can also be used in constructing software quality models and more similar studies should further investigate the issue. Based on these results, it is reasonable to claim that such a model could help for planning and executing testing by focusing resources on fault-prone parts of the design and code.
Quality assurance for micro manufacturing processes and primary-shaped micro components
Authors: Gisela Lanza, Matthias Schlipf, Juergen Fleischer
Venue: Microsystem Technologies (2008)

The development of robust and flexible manufacturing processes represents the major challenge to be overcome by industrially applicable micro production. For robustness and flexibility to be ensured also for micro dimensions, the manufacturing processes need to be controlled and continuously improved by means of a quality assurance system that is fast to respond, matches the requirements of production and is tailored to the micro-specific demands. Up to now, micro manufacturing processes have been characterized by a high degree of variability resulting from an increased number of significant influencing factors. Besides, the tolerance specifications of components with micro structures are in the micro and sub-micrometer range, requiring measuring methods to meet the highest demands in terms of accuracy. For micro manufacturing processes to be controlled on the basis of measured data, the increased significance of measuring uncertainty and measurement variation in relation to the required tolerances is to be taken into consideration. Measured data will always reflect the effect of both manufacturing and measurement variation, which may lead to wrong decisions being taken on the approval or rejection of components if the most rigid tolerance specifications need to be met. Therefore, the focus of this research document, generated as part of the Collaborative Research Center (SFB) 499, has been put on the continuous monitoring, control and separation of manufacturing and measurement variation by means of statistical methods and tools. The two ideas presented and discussed are a novel design for quality control charts and a control loop for the combination of statistical process control and statistical modeling, developed as part of the SFB 499. This article concludes by giving first results regarding the use of statistical tools in the field of micro manufacturing technology.
Brief paper: Robust tracking control of nonholonomic dynamic systems with application to the bi-steerable mobile robot
Authors: Markus Mauder
Venue: Automatica (Journal of IFAC) (2008)

A tracking controller for nonholonomic dynamic systems is proposed which allows global tracking of arbitrary reference trajectories and renders the closed loop system robust with respect to bounded disturbances. The controller is based on [Chwa, D. (2004). Sliding-mode tracking control of nonholonomic wheeled mobile robots in polar coordinates. IEEE Transactions on Control Systems Technology, 12(4), 637-644] and shows several generalizations and improvements. The control law for tracking of general nonholonomic systems using inverse kinematic models (IKM) and sliding surfaces is stated. Conditions are proven under which robust tracking is achieved for a specific system. Tracking control is applied to the bi-steerable mobile robot, and simulation results are presented.
Mining Frequent Connected Subgraphs Reducing the Number of Candidates
Authors: Andrés Gago Alonso, José Eladio Medina Pagola, Jesús Ariel Carrasco-Ochoa, José Fco. Martínez-Trinidad
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

In this paper, a new algorithm for mining frequent connected subgraphs called gRed (graph Candidate Reduction Miner) is presented. This algorithm is based on the gSpan algorithm proposed by Yan and Jan. In this method, the mining process is optimized introducing new heuristics to reduce the number of candidates. The performance of gRed is compared against two of the most popular and efficient algorithms available in the literature (gSpan and Gaston). The experimentation on real world databases shows the performance of our proposal overcoming gSpan, and achieving better performance than Gaston for low minimal support when databases are large.
Tactile Icon Design Using a Vibration Actuator in Mobile Devices
Authors: Meng-Dar Shieh, Zheng-Bin Wu
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

This study presents three attributes for composing vibration patterns: Rhythm, intensity difference, and continuous variation in intensity. The intervals and the duration of the vibrations offer the elements of rhythm; intensity difference, and continuous variation in intensity, which add a second dimension to encoding the vibration pattern. Based on the attributes, fourteen vibration patterns were encoded according to four rhythm and four different intensity types. Rhythms are composed of two vibration durations and one interval. Intensity types are High intensity, Low intensity, Strengthening, and Weakening. The results achieve 78.57% accuracy for the overall vibration patterns. Intensity differences have a correct rate of 80.89%. The results for recognition of rhythm types are 90.97%. The result shows that people can really differentiate rhythms and intensity by using their tactile senses, but this has limitations. This research provides guidelines for vibration pattern design, and a third scenario for non-visual interaction.
Empirical modeling in the area of technological process optimization and optimization of the burn-in process of electronic devices
Authors: Radovan Novotny
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

Monitor the microelectronics structures stability, consistency and overall performance need to study variation and influence of various technological factors. This article presents some important aspects related to the observation and analysis of the influence more than one variable at a time on the response of interest. Examples for creating maps of performance stability for supposed device operating conditions and related experience of realized studies are recapitulated here.
Modelling, analysis and execution of multi-robot tasks using petri nets
Authors: Hugo Costelha, Pedro Lima
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper introduces Petri net (PN) based models of cooperative robotic tasks, namely those involving the coordination of two or more robots, thus requiring the exchange of synchronisation messages, either using explicit (e.g., wireless) or implicit (e.g., vision-based observation of teammates) communication. In the models, PN places represent primitive actions, subtasks and predicates set by sensor readings and communicated messages. Events are associated to PN transitions. The PN models can be used for task planning, plan execution and plan analysis. Different PN views enable the analysis of different properties. In this work we focus on plan analysis, namely on properties such as boundedness and liveness, corresponding to checking if resources usage is stable and plans have no deadlocks, as well as on stochastic performance, concerning the plan success probability. One novel feature of our work is that the analysis consists of composing several small action PN models with environment PN models, leading to a closed loop robot team/environment analysis methodology. Examples of application to simulated robotic soccer scenarios are presented.
Hilbert-huang transform based time-frequency distribution and comparisons with other three
Authors: Ming Li, Xue-Kang Gu, Shen-Shen Yang
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

Time-frequency distribution (TFD) of signals gains increasing applications in various areas of sciences and engineering for processing non-stationary signals and nonlinear signals. Traditional methods in the field are short-time Fourier transform (STFT), generalized TFDs in the Cohen class (GTFD), and wavelet transform (WT) based TFD. Recently, Huang et al. introduced a new method called Hilbert-Huang transform (HHT). This is an adaptively data-driven approach without the limitations caused by various window functions for STFT, different kernels for GTFD, and different mother functions for WT. This paper discusses four types of TFDs with demonstrations, providing a case to show that HHT based TFD may have high resolution.
A parametric filtering algorithm for the graph isomorphism problem
Authors: Sébastien Sorlin, Christine Solnon
Venue: Constraints (2008)

We introduce a new filtering algorithm, called IDL(d)-filtering, for a global constraint dedicated to the graph isomorphism problem--the goal of which is to decide if two given graphs have an identical structure. The basic idea of IDL(d)-filtering is to label every vertex with respect to its relationships with other vertices around it in the graph, and to use these labels to filter domains by removing values that have different labels. IDL(d)-filtering is parameterized by a positive integer value d which gives a limit on the distance between a vertex to be labelled and the set of vertices considered to build its label. We experimentally compare different instantiations of IDL(d)-filtering with state-of-the-art dedicated algorithms and show that IDL(d)-filtering is more efficient on regular sparse graphs and competitive on other kinds of graphs.