ppxscal/embedding_network huggingface dataset:
W-shaped enhanced-bandwidth patch antenna for wireless communication
Authors: Abbas Ali Lotfi Neyestanak, Farrokh Hojjat Kashani, Kasra Barkeshli
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper a novel form of the familiar E-shaped patch antenna is presented. In the presented approach, by using the genetic algorithm (GA) based on fuzzy decision-making, some modifications have been implemented to the incorporated slots which lead to even more enhancement in the antenna bandwidth. The MOM (Method of Moment) is employed for analysis at the frequency band of 1.8GHz---2.6GHz by the optimization parameters of supply locations and slot dimensions. In the implemented fuzzy system, inputs are parameters like population, and outputs are parameters like recombination to produce the next generation. Fuzzy inference system (FIS) is used for the control of GA parameters. The design is also optimized by successive iterations of a computer-aided analysis package and experimental modifications. Prototype antenna, resonating at wireless communication frequencies of 1.88 and 2.37 GHz, has been constructed and experimental results are in relatively good agreement with the analysis. Dimensions of the modified slots for bandwidth enhancement, while maintaining good radiation characteristics, have been determined and the obtained antenna bandwidth of 36.7% is larger than that of a corresponding unslotted rectangular microstrip antenna or a conventional E-Shaped patch antenna. Details of the antenna design approach and experimental results are presented and discussed.
Design Automation Architecture and Applications
Authors: W. Rosenbluth
Venue: Computer (1976)

This article presents a design automation system architecture and illustrates applications of that architecture with an LSI chip design flow. It discusses system-module attributes of that architecture as those modules are encountered in the design flow.
Guido: A Musical Score Recognition System
Authors: M. Szwoch
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents an optical music recognition system Guido that can automatically recognize the main musical symbols of music scores that were scanned or taken by a digital camera. The application is based on object model of musical notation and uses linguistic approach for symbol interpretation and error correction. The system offers musical editor with a partially automatic error correction.
Simulation of complex pharmacokinetic models in Microsoft EXCEL
Authors: Ingolf Meineke, Jürgen Brockmöller
Venue: Computer Methods and Programs in Biomedicine (2007)

With the arrival of powerful personal computers in the office numerical methods are accessible to everybody. Simulation of complex processes therefore has become an indispensible tool in research and education. In this paper Microsoft EXCEL is used as a platform for a universal differential equation solver. The software is designed as an add-in aiming at a minimum of required user input to perform a given task. Four examples are included to demonstrate both, the simplicity of use and the versatility of possible applications. While the layout of the program is admittedly geared to the needs of pharmacokineticists, it can be used in any field where sets of differential equations are involved. The software package is available upon request.
On a Pin Versus Block Relationship For Partitions of Logic Graphs
Authors: B. S. Landman, R. L. Russo
Venue: IEEE Transactions on Computers (1971)

Partitions of the set of blocks of a computer logic graph, also called a block graph, into subsets called modules demonstrate that a two-region relationship exists between P, the average number of pins per module, and B, the average number of blocks per module. In the first region, P = KBr, where K is the average number of pins per block and 0.57 = r = 0.75. In the second region, that is, where the number of modules is small (i.e., 1-5), P is less than predicted by the above formula and is given by a more complex relationship. These conclusions resulted from controlled partitioning experiments performed using a computer program to partition four logic graphs varying in size from 500 to 13 000 circuits representing three different computers. The size of a block varied from one NOR circuit in one of the block graphs to a 30-circuit chip in one of the other block graphs.
GSM indoor localization
Authors: Alex Varshavsky, Eyal de Lara, Jeffrey Hightower, Anthony LaMarca, Veljo Otsason
Venue: Pervasive and Mobile Computing (2007)

Accurate indoor localization has long been an objective of the ubiquitous computing research community, and numerous indoor localization solutions based on 802.11, Bluetooth, ultrasound and infrared technologies have been proposed. This paper presents the first accurate GSM indoor localization system that achieves median within floor accuracy of 4 m in large buildings and is able to identify the floor correctly in up to 60% of the cases and is within 2 floors in up to 98% of the cases in tall multi-floor buildings. We report evaluation results of two case studies conducted over a course of several years, with data collected from 6 buildings in 3 cities across North America. The key idea that makes accurate GSM-based indoor localization possible is the use of wide signal-strength fingerprints. In addition to the 6-strongest cells traditionally used in the GSM standard, the wide fingerprint includes readings from additional cells that are strong enough to be detected, but are too weak to be used for efficient communication. We further show that selecting a subset of highly relevant channels for fingerprinting matching out of all available channels, further improves the localization accuracy.
Skew Detection for Chinese Handwriting by Horizontal Stroke Histogram
Authors: T.-H. Su, T.-W. Zhang, H.-J. Huang, Y. Zhou
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper proposes a skew detection method for real Chinese handwritten documents. After analyzing the characteristics of Chinese characters, it utilizes the horizontal stroke histogram. Its accuracy, ability to increase the recall rate of text line separation, and CPU time consuming are investigated using 853 real Chinese handwritten documents. The results show that: 1) The method can identify 98.83% of the skew angles within one degree, with an improvement of 8.44% than Wigner-Ville Distribution (WVD) method; 2) When incorporated into text line separation, the recall rate has an improvement of 2.54% than WVD method; 3) The method only consumes one-twentieth of WVD method on the same test environment.
An assessment of eye-gaze potential within immersive virtual environments
Authors: Norman Murray, Dave Roberts, Anthony Steed, Paul Sharkey, Paul Dickerson, John Rae
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2007)

In collaborative situations, eye gaze is a critical element of behavior which supports and fulfills many activities and roles. In current computer-supported collaboration systems, eye gaze is poorly supported. Even in a state-of-the-art video conferencing system such as the access grid, although one can see the face of the user, much of the communicative power of eye gaze is lost. This article gives an overview of some preliminary work that looks towards integrating eye gaze into an immersive collaborative virtual environment and assessing the impact that this would have on interaction between the users of such a system. Three experiments were conducted to assess the efficacy of eye gaze within immersive virtual environments. In each experiment, subjects observed on a large screen the eye-gaze behavior of an avatar. The eye-gaze behavior of that avatar had previously been recorded from a user with the use of a head-mounted eye tracker. The first experiment was conducted to assess the difference between users' abilities to judge what objects an avatar is looking at with only head gaze being viewed and also with eye- and head-gaze data being displayed. The results from the experiment show that eye gaze is of vital importance to the subjects, correctly identifying what a person is looking at in an immersive virtual environment. The second experiment examined whether a monocular or binocular eye-tracker would be required. This was examined by testing subjects' ability to identify where an avatar was looking from their eye direction alone, or by eye direction combined with convergence. This experiment showed that convergence had a significant impact on the subjects' ability to identify where the avatar was looking. The final experiment looked at the effects of stereo and mono-viewing of the scene, with the subjects being asked to identify where the avatar was looking. This experiment showed that there was no difference in the subjects' ability to detect where the avatar was gazing. This is followed by a description of how the eye-tracking system has been integrated into an immersive collaborative virtual environment and some preliminary results from the use of such a system.
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses
Authors: A. Aggarwal
Venue: IEEE Transactions on Computers (1986)

The problem of finding the maximum of a set of values stored one per processor on a two-dimensional array of processors with a time-shared global bus is considered. The algorithm given by Bokhari is shown to be optimal, within a multiplicative constant, for this network and for other d-dimensional arrays. We generalize this model and demonstrate optimal bounds for finding the maximum of a set of values stored in a d-dimensional array with k time-shared global buses.
Commonsense reasoning by distance semantics
Authors: Ofer Arieli
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We introduce a uniform distance semantics for different paradigms that require nonmonotonic and paraconsistent reasoning, among which are mediators of independent data-sources, integrators of prioritized knowledge-bases, operators for iterated belief revision, and analytic tools of decision support systems. We show that the consequence relations that are induced by our framework share some desirable properties and demonstrate this by relevant applications.
Calana: a general-purpose agent-based grid scheduler
Authors: M. Dalheimer, F.-J. Pfreundt, P. Merz
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Grid resource allocation is a complex task usually solved by systems relying on a centralized information system. In order to create a lightweight scheduling system, we investigated the potential of auctions for resource allocation. Each resource provider runs an agent bidding on the execution of software with respect to local restrictions. This way, the information system becomes obsolete. In addition, each provider can implement different bidding strategies in order to reflect his preferences.
A Tristate Approach Based on Weighted Mean and Backward Iteration
Authors: Yanhua Ma, Chuanjun Liu, Haiying Sun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A tristate approach (TA) for image denoising processing is presented; the noise is aimed at the presence of pepper-and-salt noise. The newness of this method is that it develops a new route in the field of image restoration. The tristate approach algorithm focuses on the removal and restoration of the noisy speckles and avoids blurring and averaging edges and non-noise pixels in a way different from other known algorithms. Any noisy pixel is replaced by an estimated value. This value is the weighted mean of the pixels neighboring to the noisy pixel or the four iteration pixels got before it. This paper describes, analyzes and compares several methods and results of removing noise from an image. We have performed the experiments by adding Salt-and-Pepper in an original image.
Processing forecasting queries
Authors: Songyun Duan, Shivanath Babu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Forecasting future events based on historic data is useful in many domains like system management, adaptive query processing, environmental monitoring, and financial planning. We describe the Fa system where users and applications can pose declarative forecasting queries---both one-time queries and continuous queries---and get forecasts in real-time along with accuracy estimates. Fa supports efficient algorithms to generate execution plans automatically for forecasting queries from a novel plan space comprising operators for transforming data, learning statistical models from data, and doing inference using the learned models. In addition, Fa supports adaptive query-processing algorithms that adapt plans for continuous forecasting queries to the time-varying properties of input data streams. We report an extensive experimental evaluation of Fa using synthetic datasets, datasets collected on a testbed, and two real datasets from production settings. Our experiments give interesting insights on plans for forecasting queries, and demonstrate the effectiveness and scalability of our plan-selection algorithms.
The Movement and Permutation of Columns in Magnetic Bubble Lattice Files
Authors: A. K. Chandra
Venue: IEEE Transactions on Computers (1979)

In this paper, we propose a layout of access channels in a new kind of magnetic bubble memory called a bubble lattice file. We further assume that interchange of bubble columns under certain channels is possible. We then propose an algorithm for moving a column to any other location using minimal number of column interchanges. The algorithm and the proof of its optimality involves signed-digit representation of numbers by a mixed radix system. Based on this, we next propose a simple algorithm to permute a set of columns. Analysis of this algorithm for both the worst and average case is given. The algorithm is shown to be close to optimal for both cases. Finally, based on an optimization consideration, a geometric layout of access channels is suggested for the best performance of the proposed algorithm.
Point Stabilization of Wheeled Mobile Robots Based on Artificial Potential Field and Genetic Algorithm
Authors: Haili Xu, Jianhua Li, Xiaodong Wu, Sun'an Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Point stabilization is the major control problem of nonholonomic wheeled mobile robots (WMRs). In this paper, a novel simple tracking controller is presented based on the kinematics models. An artificial potential field is used to navigate the wheeled robot in the controller. Easy design, fast convergence, and adaptability to other nonholonomic mobile are obvious advantages. The control parameters of this system are optimized by Genetic Algorithm. Then, the parameters are tuned and used in the actual system. The good effect of the control is gotten. The stability of the controller is confirmed, and the effectiveness of the controller is demonstrated via computer simulation and their implementation.
Producing a Global Requirement Model from Multiple Requirement Specifications
Authors: Erwan Brottier, Benoit Baudry, Yves Le Traon, David Touzet, Bertrand Nicolas
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

collection of partial specifications produced by different stakeholders. Obtaining a global specification is a fundamental step of a requirement analysis process. Merging requirement specifications is indeed a way to reveal inconsistencies between them. We propose in this paper a model-driven mechanism for that purpose. It takes as inputs a set of texts or models which conform to input requirement languages and produces a global requirements model. This mechanism is integrated in a platform called R2A which stands for "requirements to analysis". The R2A core element is its core requirement metamodel which has been defined for capturing the global requirements model. We illustrate our approach with requirement specifications expressed in a constrained natural language. This platform and its mechanism have been completely implemented with MDE (Model Driven Engineering) technologies. As such, it is a good example of how MDE technologies can contribute to requirements engineering as a technical solution.
DyKnow: An approach to middleware for knowledge processing
Authors: Fredrik Heintz, Patrick Doherty
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

Any autonomous system embedded in a dynamic and changing environment must be able to create qualitative knowledge and object structures representing aspects of its environment on the fly from raw or preprocessed sensor data in order to reason qualitatively about the environment. These structures must be managed and made accessible to deliberative and reactive functionalities which are dependent on being situationally aware of the changes in both the robotic agent's embedding and internal environment. DyKnow is a software framework which provides a set of functionalities for contextually accessing, storing, creating and processing such structures. The system is implemented and has been deployed in a deliberative/reactive architecture for an autonomous unmanned aerial vehicle. The architecture itself is distributed and uses real-time CORBA as a communications infrastructure. We describe the system and show how it can be used in execution monitoring and chronicle recognition scenarios for UAV applications.
Eliciting concepts of place for text-based image retrieval
Authors: Alistair J. Edwardes, Ross S. Purves
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

This paper describes research being employed in the Tripod project to improve the retrieval of photographs through a comprehensive knowledge of where they were taken. The methods described here attempt to elicit semantics, and thus terms for use in indexing, related to the idea of place from theoretical geography. Three approaches are outlined: literature-based, empirical experiments, and data mining.
Toward botnet mesocosms
Authors: Paul Barford, Mike Blodgett
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

An in-depth understanding of botnet behavior is a precursor to building effective defenses against this serious and growing threat. In this paper we describe our initial steps toward building a flexible and scalable laboratory testbed for experiments with bots and botnets. Our Botnet Evaluation Environment (BEE) is designed to enable individual bots or networks of up to thousands of bots to be tested in a secure, self-contained framework. BEE is being developed as a toolkit for Emulab-enabled network testbeds; a design choice made to obviate the need for building user/experiment management functions and to enable access to collections of computing hosts. The focus of our implementation efforts has been on building a library of OS/Bot images that can be run on individual systems or on virtual machines. The library currently includes images generated from source code of four well known bots (Agobot, GTbot, Spybot, SDbot) and from binary code for several unknown bots, and a number of Windows OS variants. BEE also includes a set of services that are required for botnets including DHCP, DynDNS, and IRC, as well as other tools that are useful for botnet measurement and evaluation such as VM monitors and honeypots. To demonstrate the utility of BEE, we describe a simple set of tests that characterizes command and control traffic from three different botnet configurations.
NFL-SVM: An Effective Algorithm for Solving Misclassification in SVM
Authors: Xianfei Zhang, Bicheng Li, Panyuan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Considering the problem of low classification accuracy of similar category, this paper proposes NFL-SVM, an effective algorithm for solving misclassification in SVM. By analysis and deduction, this paper indicates that SVM can be considered the Nearest Neighbor Classifier of just one feature point in each category. KNFL regards lines of all points as feature lines, so it can be used to overcome defaults in SVM. The results of experiment at last show us that NFL-SVM can provide a better performance in classification accuracy.
HMM-Based Recognizer with Segmentation-free Strategy for Unconstrained Chinese Handwritten Text
Authors: T.-H. Su, T.-W. Zhang, H.-J. Huang, Y. Zhou
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

A segmentation-free strategy based on Hidden Markov Models (HMMs) is presented for offline recognition of unconstrained Chinese handwriting. As the first step, handwritten textlines are converted to observation sequence by sliding windows and character segmentation stage is avoided prior to recognition. Following that, embedded Baum-Welch algorithm is adopted to train character HMMs. Finally, best character string maximizing the a posteriori is located through Viterbi algorithm. Experiments are conducted on the HIT-MW database written by more than 780 writers. The results show: First, our baseline recognizer outperforms one segmentation-based OCR product with 35% relative improvement; second, more discriminative feature and compact representation, and state-tying technique to alleviate the data sparsity can enhance the recognizer with high confidence. The final recognizer has improved the performance by 10.77% than the baseline system.
Snapshots: Capturing Dynamics of Student Sketches
Authors: Sandra B. Fan, Steven L. Tanimoto
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

As part of a larger solution to the problem of diagram assessment in online education, this paper explores how to allow students to "show their work" in the creation of a sketch, the same way they might show their work on, say, a math problem. We propose a Snapshot feature as an extension to our web-based Sketch Tool. This feature allows students to capture individual steps of sketch creation and then play them back. Instructors then have more information with which to assess student knowledge. Additionally, this paves the way for automated assessment--instead of a software tool having to go through every sketch and try to determine the relevant ones, it can focus on the steps students have labeled as important. Students could also use the feature as a rudimentary animation tool, or work collaboratively by adding on to other students' Snapshot sequences.