ppxscal/embedding_network huggingface dataset:
Teaching Microcomputer Interfacing to Non-Electrical Engineers
Authors: P. R. Rony
Venue: Computer (1977)

Anticipation of the future social impact of the microcomputer has underscored the need on the part of most institutions of higher education to develop methods of teaching non-electrical engineers the basic principles and applications of microcomputers. During the past two years at Virginia Polytechnic Institute & State University, we have made significant progress in that direction: we have developed laboratory hardware and written several selfinstructional laboratory workbooks that permit a novice in electronics to learn the basic principles of digital electronics, the 7400-series of integrated circuit chips, asynchronous serial digital communication techniques, microcomputer programming, and 8080A microcomputer interfacing. Within only two quarters, our students-many of whom have had no prior exposure to electronics and none of whom have substantial undergraduate or graduate course time available for studying electronics can learn sufficient digital electronics and microcomputer interfacing to undertake projects of modest complexity. Student response to the course has been enthusiastic.
Adapting operator settings in genetic algorithms
Authors: Andrew Tuson, Peter Ross
Venue: Evolutionary Computation (1998)

In the majority of genetic algorithm implementations, the operator settings are fixed throughout a given run. However, it has been argued that these settings should vary over the course of a genetic algorithm run---so as to account for changes in the ability of the operators to produce children of increased fitness. This paper describes an investigation into this question. The effect upon genetic algorithm performance of two adaptation methods upon both well-studied theoretical problems and a hard problem from operations research, the flowshop sequencing problem, are therefore examined. The results obtained indicate that the applicability of operator adaptation is dependent upon three basic assumptions being satisfied by the problem being tackled.
A Mean Field Annealing Algorithm for Fuzzy Clustering
Authors: Chi-Hwa Song, Jin-Ku Jeong, Dong-Hun Seo, Won Don Lee
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In the classical clustering, an item must entirely belong to a cluster. Fuzzy clustering, however, describes more accurately the ambiguous type of structure in data. Fuzzy clustering is useful for partitioning a set of objects into a certain number of groups by assigning the membership probabilities to each object. In fuzzy clustering, the membership of each datum in each cluster is represented by the membership matrix. In the proposed method, the elements of membership matrix are updated in parallel until they reach one of the global optimal solutions. It differs from the traditional fuzzy clustering methods. In classical fuzzy clustering, the centroid vectors of the clusters in the space are calculated, and then the membership probability matrix is determined, and the process is repeated until the optimum solution is found. By contrast, the method proposed here perturbs the membership probability, and determines whether the the perturbed state should be accepted or not according to the changes of the energy. One Variable Stochastic Simulated Annealing(OVSSA), a continuous valued version of the Mean Field Annealing(MFA) algorithm which is known as a massively parallel algorithm, is employed as an optimization technique. The MFA combines characteristics of the simulated annealing and the neural network and exhibits the rapid convergence of the neural network while preserving the solution quality afforded by Stochastic Simulated Annealing(SSA).
Concept Maps Combined with Case-Based Reasoning in Order to Elaborate Intelligent Teaching/Learning Systems
Authors: Maikel Len Espinosa, Natalia Martinez Sanchez, Zenaida Garcia Valdivia, Rafael Bello Perez
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The use of pedagogical methods with the technologies of the information and communications produce a new quality that favors the task of generating, transmitting and sharing knowledge. Such is the case of the pedagogical effect that produces the use of the Concept Maps, which constitute a tool for the management of knowledge, an aid to personalize the learning process, to exchange knowledge, and to learn how to learn. Effective knowledge management maintains the knowledge assets of an organization by identifying and capturing useful information in a usable form, and by supporting refinement and reuse of that information in service of the organization's goals. Concept Mapping provides a framework for making this internal knowledge explicit in a visual form that can easily be examined and shared. However, it does not address how relevant Concept Maps can be retrieved or adapted to new problems. Case-Based Reasoning is playing an increasing role in knowledge retrieval and reuse for corporate memories, and its capabilities are appealing to augment the concept mapping process. In this paper the authors present a new approach to elaborate Intelligent Teaching-Learning Systems, where the techniques of concepts diagrams and Artificial Intelligence are combined, using the Case-Based Reasoning as theoretical framework for the Student Model. The proposed model has been implemented in the computational system HESEI, which has been successfully applied in the teaching-learning process by laymen in the Computer Science field.
CMS for engineering in DCBI: first evaluation
Authors: Silvia B. González Brambila, Mauricio G. Bastién Montoya
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper we describe the design and implementation of a virtual environment for the Division of Basic Sciences and Engineering of the Azcapotzalco Campus of the Metropolitan Autonomous University in Mexico City. The project was started in May, 2005 to meet the need of teachers and students to have a space to place different didactic materials. The virtual environment consists of three main subsystems: CMS for teaching and learning process; virtual evaluation subsystem and virtual resources subsystem. The cbiEnLinea project supports undergraduate and graduate programs, whose main objective is to build a virtual space that will help improving the teaching and learning process. We present the results of the first evaluation of the CMS.
An Effective Drill-Down Paths Pruning Method in OLAP
Authors: Dehui Zhang, Shiwei Tang, Dongqing Yang, Lizheng Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The complexity of multi-dimensional data structure affects the efficiency of OLAP, because there are too many drill-down paths to be chosen from when analysis. While most methods in the literature are associated to some specific analysis tasks, so they cannot get reasonable effect. In this paper, we proposed a new method that is irrelevant to analysis task that we try to prune the invalid drill-down operations. The vectorial angle method is employed to evaluate the validness of every drill-down operation. We give the corresponding path pruning algorithm, and it is effective that it takes the fact table as the input in only one pass scanning. The experiments show that our method is feasible, effective, sparsity-proof and skewness-proof.
Table Recognition and Understanding from PDF Files
Authors: T. Hassan, R. Baumgartner
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

We propose a flexible method for detecting and under- standing tables in PDF files, which is not reliant upon one particular feature being present, for example ruling lines or indentations, and is therefore applicable to a wide variety of visual presentations. We describe the steps required in transforming the low-level PDF instructions into text seg- ments, lines and boxes on a page. We propose three different classifications for published tables, and develop methods to detect these tables and correctly identify their respective rows and columns. We also explain how to recognize span- ning rows and columns, and multi-line rows. Experimental results show that our algorithm is effective in converting a wide variety of tabular presentations into HTML for infor- mation extraction purposes.
Google's MapReduce programming model – Revisited
Authors: Ralf Lämmel
Venue: Science of Computer Programming (2008)

Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including its advancement as Google's domain-specific language Sawzall. To this end, we reverse-engineer the seminal papers on MapReduce and Sawzall, and we capture our findings as an executable specification. We also identify and resolve some obscurities in the informal presentation given in the seminal papers. We use typed functional programming (specifically Haskell) as a tool for design recovery and executable specification. Our development comprises three components: (i) the basic program skeleton that underlies MapReduce computations; (ii) the opportunities for parallelism in executing MapReduce computations; (iii) the fundamental characteristics of Sawzall's aggregators as an advancement of the MapReduce approach. Our development does not formalize the more implementational aspects of an actual, distributed execution of MapReduce computations.
Research on Particle Swarm Optimization and its Industrial Application
Authors: XiaoLing Huang, Na Sun, Wei Liu, JunXiu Wei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Particle swarm optimization (PSO) has been shown to be an efficient, robust and simple optimization algorithm. Aim at the shortcoming that the PSO algorithm falls into local optimization easily, in this paper fuzzy control theory is introduced into PSO (FPSO). Parameters may be dynamic adjusted themselves according to the optimization effect every time in this algorithm. Its ability of dynamic adjustment is strengthened, and the global optimization performance of the algorithm can be improved better. And in this paper, the improved algorithm is illustrated how could solve the problem, which exists in the raw material requirement model for production processing in the ore dressing plant. The experimental results are provided to support the conclusions drawn from the theoretical findings.
A Minicomputer-Based Information System for a Small Business
Authors: D. L. Fulton
Venue: Computer (1976)

Small businesses have generally relied on service bureaus for management information. In general, the services provided have been on an out-of-house basis, with transactions being periodically forwarded to a service's centralized computer installation. An edit of the data is performed, and any errors in the data are reported back to the client. Corrections may then be transmitted with the next batch of transactions. Summary operating information may be provided, possibly on a daily basis, but usually detailed reports are mailed back on a weekly and/or monthly basis depending on the particular function.
802.11 Qos Cross-Layer Protocol Based Propagation Conditions Adaptation
Authors: Jalel Ben-Othman, Souheila Bouam, Farid Nait-Abdesselam
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Due to its increasingly growing capacity, WLANs are becoming mature enough to be integrated in a real commercial multi-service offers. However, their success will mainly depend on their ability to provide quality of service for different media types (audio, video, etc.). In this paper, we devise a new protocol which provides a more strict service differentiation between different traffics. The protocol deals also with the well known 802.11 anomaly and improves network throughput by using separate contention window ranges reinforced by a packet length differentiation. Thus, each flow will be seen allocated a selected backoff interval and a packet length from variable bounded ranges to improve both throughput and delay. The different backoffs and packet lengths vary dynamically depending on the propagation conditions. Fairness is then taken into consideration as the adaptation is made sensitive to upper-layers' quality of service metrics as well as to the propagation conditions observed at the PHY layer expressed with SNR value, carrying out a crosslayer architecture.
How the Cyber Defense Exercise Shaped an Information-Assurance Curriculum
Authors: Barry E. Mullins, Timothy H. Lacey, Robert F. Mills, Joseph E. Trechter, Samuel D. Bass
Venue: IEEE Security and Privacy (2007)

The US Air Force Institute of Technology's curriculum and course format evolved based on experiences with the Cyber Defense Exercise, an annual cyberwarfare exercise sponsored by the US National Security Agency.
A versatile propagation channel simulator for MIMO link level simulation
Authors: Jean-Marc Conrat, Patrice Pajusco
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

This paper presents a propagation channel simulator for polarized bidirectional wideband propagation channels. The generic channel model implemented in the simulator is a set of rays described by geometrical and propagation features such as the delay, 3D direction at the base station and mobile station and the polarization matrix. Thus, most of the wideband channel models including tapped delay line models, tap directional models, scatterer or geometrical models, ray-tracing or ray-launching results can be simulated. The simulator is composed of two major parts: firstly the channel complex impulse responses (CIR) generation and secondly the channel filtering. CIRs (or CIR matrices for MIMO configurations) are processed by specifying a propagation model, an antenna array configuration, a mobile direction, and a spatial sampling factor. For each sensor, independent arbitrary 3D vectorial antenna patterns can be defined. The channel filtering is based on the overlap-and-add method. The time-efficiency and parameterization of this method are discussed with realistic simulation setups. The global processing time for the CIR generation and the channel filtering is also evaluated for realistic configuration. A simulation example based on a bidirectional wideband channel model in urban environments illustrates the usefulness of the simulator.
An efficient return algorithm for non-associated plasticity with linear yield criteria in principal stress space
Authors: Johan Clausen, Lars Damkilde, Lars Andersen
Venue: Computers and Structures (2007)

An efficient return algorithm for stress update in numerical plasticity computations is presented. The yield criterion must be linear in principal stress space and can be composed of any number of yield planes. Each of these yield planes may have an associated or non-associated flow rule. The stress return and the formation of the constitutive matrix is carried out in principal stress space. Here the manipulations simplify and rely on geometrical arguments. The singularities arising at the intersection of yield planes are dealt with in a straightforward way also based on geometrical considerations. The method is exemplified on non-associated Mohr-Coulomb plasticity throughout the paper.
Some Problems in Certifying Microprograms
Authors: G. B. Leeman
Venue: IEEE Transactions on Computers (1975)

A hypothetical computer is described, and procedures are indicated for showing the correctness of its microprogram. The underlying method used is that of Birman [1]. However, the computer discussed has some realistic characteristics not shared by the machine treated in [1], and the details of the microcode validation are complicated by this fact. A formal technique for partitioning the proof is presented and illustrated with examples.
Dimensionality Reduction in a P2P System
Authors: Mouna Kacimi, Kokou Yetongnon
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Peers and data objects in the Hybrid Overlay Network (HON) are organized in a n-dimensional feature space. As the dimensionality increases, peers and data objects become sparse and the distance measures become increasingly meaningless which leads to serious problems affecting HON performance. In this paper we propose a distributed feature selection technique reduce the dimensionaliy in HON. We study in our simulations the impact of the proposed feature selection technique on query results quality and show that it achieves high recall and precision.
A Note on Q-Universal Logic Modules
Authors: Sureshchander
Venue: IEEE Transactions on Computers (1974)

Some comments are offered on the number of I/O terminals p of the Q-universal logic modules (ULM) [2]. An equation is given in this note which will determine minimum number of I/O terminals for all n.
WearIT@work: Toward Real-World Industrial Wearable Computing
Authors: Paul Lukowicz, Andreas Timm-Giel, Michael Lawo, Otthein Herzog
Venue: IEEE Pervasive Computing (2007)

The wearIT@work project, financed by the European Union, aims at facilitating real-life industrial deployment of wearable technology. With 42 partners, a project funding of 23.7 million, this consortium is the largest civilian wearable-computing effort worldwide. The project is organized around four pilot applications—aircraft maintenance, car production, healthcare, and emergency response—that drive the work in a bottom-up, user-centered approach.
Spatial filters for mobile information retrieval
Authors: David M. Mountain
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

This paper introduces the concept of spatial filters as an approach to increasing the relevance of the information retrieved by users of mobile information systems. This approach applies post-query filters to remove results that are deemed not relevant given some aspect of a mobile individual's spatial behaviour. The aim is to reduce the volume of results returned to users of mobile information systems, to avoid the need for manual filtering. An opportunity for future research is to consider how these filters can be applied to the task of combining rankings based upon thematic and spatial criteria, for documents retrieved from unstructured or semi-structured collections, such as those handled by geographic information retrieval systems.
Statistical inference and prediction for the Weibull process with incomplete observations
Authors: Jun-Wu Yu, Guo-Liang Tian, Man-Lai Tang
Venue: Computational Statistics Data Analysis (2008)

In this article, statistical inference and prediction analyses for the Weibull process with incomplete observations via classical approach are studied. Specifically, observations in the early developmental phase of a testing program cannot be observed. We derive the closed-form expressions for the maximum likelihood estimates of the parameters in both the failure- and time-truncated Weibull processes. Confidence interval and hypothesis testing for the parameters of interest are considered. In addition, predictive inferences on future failures and the goodness-of-fit test of the model are developed. Two real examples from an engine system development study and a Boeing air-conditioning system development study are presented to illustrate the proposed methodologies.
Using the mobile phone as a security token for unified authentication
Authors: Steffen Hallsteinsen, Ivar Jorstad, Do Van Thanh
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

The number of different identities and credentials used for authentication towards services on the Internet has increased beyond the manageable. Still, the most common authentication scheme is based on usernames and passwords. This is a weak authentication mechanism, which can be broken by eavesdropping on the network connection or by sloppy handling by the users (e.g. re-use of the same password for different services, writing down the passwords on paper etc.). Also, management of user credentials is a costly task for most companies, estimated by IDC to around 200-300USD pr. user/year. Hence, better solutions for simplified, yet secure authentication, is required in the future. This paper proposes and describes an authentication scheme based on a One-Time Password (OTP) MIDlet running on a mobile phone for unified authentication towards any type of service on the Internet.
SP2: exposing ada web services using a service-oriented architecture (SOA)
Authors: Ricky E. Sward
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

This tutorial covers the principles of Service-Oriented Architectures (SOA) including loose coupling, encapsulation, reusability, composibility, etc. The attendee will learn about the Ada Web Server (AWS) and how SOA interfaces, session management, etc. are implemented using AWS. The tutorial will also cover the fundamentals of the Enterprise Service Bus (ESB), a key enabling component of the SOA. Attendees will learn about ESB endpoints, data routing, automatic translations, etc. They will also learn how to connect Ada web services to an ESB, how to expose the web services, and how to use AWS with the ESB through in-class exercises and demonstrations. The tutorial will be very interactive and attendees are encouraged to bring their laptop computers.
Tower-top antenna array calibration scheme for next generation networks
Authors: Justine McCormack, Tim Cooper, Ronan Farrell
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

Recently, there has been increased interest in moving the RF electronics in basestations from the bottom of the tower to the top, yielding improved power efficiencies and reductions in infrastructural costs. Tower-top systems have faced resistance in the past due to such issues as increased weight, size, and poor potential reliability. However, modern advances in reducing the size and complexity of RF subsystems have made the tower-top model more viable. Tower-top relocation, however, faces many significant engineering challenges. Two such challenges are the calibration of the tower-top array and ensuring adequate reliability. We present a tower-top smart antenna calibration scheme designed for high-reliability tower-top operation. Our calibration scheme is based upon an array of coupled reference elements which sense the array's output. We outline the theoretical limits of the accuracy of this calibration, using simple feedback-based calibration algorithms, and present their predicted performance based on initial prototyping of a precision coupler circuit for a 2 × 2 array. As the basis for future study a more sophisticated algorithm for array calibration is also presented whose performance improves with array size.