ppxscal/embedding_network huggingface dataset:
Design and analysis of direct-action CMAC PID controller
Authors: Hung-Ching Lu, Jui-Chi Chang, Ming-Feng Yeh
Venue: Neurocomputing (2007)

This paper is to propose a direct-action (DA) cerebellar model articulation controller (CMAC) proportional-integral-derivative (PID) controller. The proposed controller, termed the DAC-PID controller, can generate four simple types of the nonlinear functions and then determine a control effort from those functions to control the process. In addition, the real-coded genetic algorithm is used to tune the parameters of the DAC-PID controller such that we can optimize those parameters. The performance of the proposed controller is also discussed in the sense of quantitative analysis. Simulation results demonstrate that the DAC-PID controller is superior to the conventional PID controller tuned by Ziegler-Nichols method and, moreover, as better as the optimal PID controller and the optimal fuzzy-PID controller.
An Agent-Based Prototype of Asynchronous Distance e-Learning System for Facilities Planning Courses
Authors: Kung-Jeng Wang
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This study addresses issues pertaining to asynchronous distance e-learning of facilities planning course for industrial engineering and management undergraduates. A prototype is developed on the basis of the specification for asynchronous distance learning by the ministry of education of Taiwan. The Learning Space system is employed as a platform to develop the context of the course. The whole system is constructed using agent-based concept and consists of three modules-Learning Space application, Internet-based course content, and a bidding game system. The system includes course material, evaluation mechanism, homework setting, bulletin board, and student profiles and is successfully practiced in a sophomore level course for more than 190 undergraduates. The system is the first trial among industrial engineering departments in Taiwan for distance learning, which allows students to access course material distantly as well as involve in a virtual course circumstance harmoniously. A questionnaire investigation reveals that via the use of the system the students participated in this course have exhibited their enthusiasm in learning process.
A Wireless Sensor Node Architecture Using Remote Power Charging, for Interaction Applications
Authors: Matthew D'Souza, Konstanty Bialkowski, Adam Postula, Montserrat Ros
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

The wireless sensor node architecture proposed in this paper is optimized for use in a wireless interactive point, listen and see system. In particular, we focus on developing a wireless sensor node that can be remotely charged by harvesting microwave energy. The current system implementation allows a user to access information from a remote sensor via their mobile computing device. These sensors are limited in complexity due to the limited power available, and are cumbersome since manual intervention is required to replace its batteries. We propose a system where battery powered wireless sensor nodes can be recharged by harvesting energy from a microwave Radio Frequency (RF) signal source. The remote power charging module of the wireless sensor node architecture consisted of an antenna array and a rectification circuit. A prototype of the antenna array and rectification circuit of the remote power charging module for the wireless sensor node was constructed and is presented in this paper.
An Adaptive Shared/Private NUCA Cache Partitioning Scheme for Chip Multiprocessors
Authors: Haakon Dybdahl, Per Stenstrom
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

The significant speed-gap between processor and memory and the limited chip memory bandwidth make last-level cache performance crucial for future chip multiprocessors. To use the capacity of shared last-level caches efficiently and to allow for a short access time, proposed non-uniform cache architectures (NUCAs) are organized into per-core partitions. If a core runs out of cache space, blocks are typically relocated to nearby partitions, thus managing the cache as a shared cache. This uncontrolled sharing of all resources may unfortunately result in pollution that degrades performance. We propose a novel non-uniform cache architecture in which the amount of cache space that can be shared among the cores is controlled dynamically. The adaptive scheme estimates, continuously, the effect of increasing decreasing the shared partition size on the overall performance. We show that our scheme outperforms a private and shared cache organization as well as a hybrid NUCA organization in which blocks in a local partition can spill over to neighbor core partitions.
A Rule-Based System for Optimizing Combinational Logic
Authors: Aart De Geus, William Cohen
Venue: IEEE Design Test (1985)

SOCRATES is a rule-based expert system that optimizes combinational logic for a specific target technology. The system performssubstitutions of equivalent gate configurations, thereby reducing the overall area of the implementation and improving thespeed of the design. A control mechanism uses various backup strategies to choose the rules applied to the circuit. Userscan easily extend the library of transformation rules through a rule generation module that automatically encodes rules andinserts them into the knowledge base. Timing constraints placed on the circuit can be modified to allow the designer to explorea large design space in a matter of minutes. Implementations generated by the system are comparable in area and speed to circuitsdesigned by experts.
Fair Scheduling Algorithms in Grids
Authors: Nikolaos Doulamis, Emmanouel Varvarigos1, Theodora Varvarigou
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In this paper, we propose a new algorithm for fair scheduling, and we compare it to other scheduling schemes such as the Earliest Deadline First and the First Come First Serve schemes. Our algorithm uses a max-min fair sharing approach for providing fair access to users. When there is no shortage of resources, the algorithm assigns to each task enough computational power for it to finish within its deadline. When there is congestion, the main idea is to fairly reduce the CPU rates assigned to the tasks, so that the share of resources that each user gets is proportional to the user’s weight. The weight of a user may be defined as the user’s contribution to the infrastructure or the price he is willing to pay for services or any other socioeconomic consideration. In our algorithms, all tasks whose requirements are lower than their fair share CPU rate are served at their demanded CPU rates. However, the CPU rates of tasks whose requirements are larger than their fair share CPU rate are reduced to fit the total available computational capacity in a fair manner.Three different versions of fair scheduling are adopted in this paper; the Simple Fair Task Order (SFTO), which schedules the tasks according to their respective fair completion times, the Adjusted Fair Task Order (AFTO), that refines the SFTO policy by ordering the tasks using the adjusted fair completion times, and the Max-min Fair Share (MMFS) scheduling policy, which simultaneously addresses the problem of finding a fair task order and assigning a processor to each task based on a Max-Min fair sharing policy. Experimental results and comparisons with traditional scheduling schemes, such as the Earliest Deadline First (EDF) and the First Come First Served (FCFS) are presented using three different error criteria. Validation of the simulations using real experiments of tasks generated from 3D image rendering processes is also provided. The three proposed scheduling schemes can be integrated into existing Grid computing architectures
A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL
Authors: Hamdi Yahyaoui, Mourad Debbabi, Nadia Tawbi
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The main intent of this paper is to present a semantic framework for the validation of JVML/CLDC optimizations. The semantic style of the framework is denotational and rests on an extension of the resource pomsets semantics of Gastin and Mislove [12]. The resource pomsets is a fully abstract semantic model that is based on true concurrency. However, it does not support non-determinism that emerges while interpreting JVML/CLDC programs. In this paper, we present an extension of this model that aims to support unbounded non-determinism. More precisely, we give an overview of the construction of the process space and exhibit its algebraic properties. The elaborated semantics is embedded in the proof assistant Isabelle [28] in order to validate optimizations of JVML/CLDC programs. A case study for the validation of some optimizations of JVML/CLDC programs is also presented. The studied optimizations are: constant propagation and dead assignment elimination. 30350356
On Minimal Test Sets for Locating Single Link Failures in Networks
Authors: T. Ibaraki
Venue: IEEE Transactions on Computers (1981)

Consider a network which can be represented by an acyclic directed graph such that the links represented by the edges are subject to failure. Under the assumption that at most one link can fail at any time, we want to locate a failed link, if any, by means of certain tests. A test is performed by injecting a signal at a vertex and monitoring it at another vertex and can reveal if there is a failed link on any path between the two vertices. We want to find a minimal set of tests that can uniquely locate any single fault. Since this problem is in general NP-complete, we investigate a special case where the given network has a tree structure. We present an algorithm whose worst case running time can be bounded by a linear function of the input size.
SemFilter: A Simple and Efficient Semantic Filtering of XML Messages
Authors: Jaehoon Kim, Seog Park
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Until now, most researches for XML message filtering have focused on the efficient and scalable path matching of a large number of XPath queries over a continuous XML data stream. However, we think there is another key problem of the semantic interoperability of subscribed XPath queries against heterogeneous data sources. Recent studies only assume that the filtering system maintains a single global schema covering all data sources, or the data sources follow the defined global schema. However, beyond the simple assumption, the data sources can have various different element tag structures and names, although related with a similar subject. Therefore, the path expression of a subscribed query against a specific data source cannot be matched with other data sources that have semantically the same information. In order to resolve this problem, a query translation method rewriting the subscribed path expression into one corresponding to each data source is required. In this paper, we introduce the problem of semantic interoperability in XML message filtering and suggest a novel query translation method.
Khmer POS Tagger: A Transformation-based Approach with Hybrid Unknown Word Handling
Authors: Chenda Nou, Wataru Kameyama
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents an initiative research on Khmer part-of-speech tagger. We propose some modifications on applying rule algorithm of the transformation-based approach to adapt to Khmer language which is morphologically and syntactically different from the English language. Furthermore, to overcome the limited coverage of the rule-based approach in handling unknown words, we propose a hybrid approach to combine the rule-based and trigram models. Although training on a very small corpus, both proposed approaches achieve higher accuracy than the conventional methods. The tagger achieves 95.27% on training data and 91.96% on test data which includes 9% of unknown words.
Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands
Authors: A. K. Verma
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer arithmetic and datapath design, where designers still rely mostly on well studied architectures; on datapaths, in most cases, logic synthesis plays at most a minor role in the optimisation of netlists. A case in point is multiple additions performed in carry-save form, such as those fundamentally constituting parallel multipliers: column compressors are usually built exploiting the regularity of the circuit and, due to the very large number of XOR operations, are hardly optimised further by logic synthesisers. In fact, due to the shortcomings of algebraic factoring, XOR operations are usually left untouched by logic synthesisers. In this paper we show a general technique to optimise XOR dominated circuits and we demonstrate its effectiveness on multiplier-like circuits. We show that it optimises significantly the best parallel multipliers by exploiting complex dependencies between the addenda which escape known manual optimisations. Netlists corresponding to top arithmetic architectures can either be synthesised directly or preprocessed through our technique before standard logic synthesis: our preprocessing stage makes it possible to achieve some 20% speed improvement. To our best knowledge, optimisations of the type we show for multiplier-like structures have never been reported - neither manually derived, in computer arithmetic literature, nor automatically derived, in design automation literature.
Multi-Connection Mechanism of Mobile Agent in Grid
Authors: Zhirou Zhang, Wengang Cheng, Dawei Dong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Grid is a research hot point in computer industry. In this paper, Mobile Agents are used as carriers of distributed tasks in grid, which can migrate between grid services autonomously and intelligently. Some Mobile Agents transmit a great deal of data in high-bandwidth and high-delay grid environment. According to features of grid and Mobile Agents, a new multiple connection mechanism is proposed. Experiments have proved that this mechanism, in which both transmission delay and package loss is thought as indicator of congestion, have higher transmission speed than the mechanism in which only package loss is thought as indicator of congestion.
The BikeNet mobile sensing system for cyclist experience mapping
Authors: S. B. Eisenman, E. Miluzzo, N. D. Lane, R. A. Peterson, G-S. Ahn, A. T. Campbell
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

We describe our experiences deploying BikeNet, an extensible mobile sensing system for cyclist experience mapping leveraging opportunistic sensor networking principles and techniques. BikeNet represents a multifaceted sensing system and explores personal, bicycle, and environmental sensing using dynamically role-assigned bike area networking based on customized Moteiv Tmote Invent motes and sensor-enabled Nokia N80 mobile phones. We investigate real-time and delay-tolerant uploading of data via a number of sensor access points (SAPs) to a networked repository. Among bicycles that rendezvous en route we explore inter-bicycle networking via data muling. The repository provides a cyclist with data archival, retrieval, and visualization services. BikeNet promotes the social networking of the cycling community through the provision of a web portal that facilitates back end sharing of real-time and archived cycling-related data from the repository. We present: a description and prototype implementation of the system architecture, an evaluation of sensing and inference that quantifies cyclist performance and the cyclist environment; a report on networking performance in an environment characterized by bicycle mobility and human unpredictability; and a description of BikeNet system user interfaces. Visit [4] to see how the BikeNet system visualizes a user's rides.
The electrical characteristics of Sn/methyl-red/p-type Si/Al contacts
Authors: M. E. Aydın, A. Türüt
Venue: Microelectronic Engineering (2007)

The junction characteristics of the organic compound methyl-red film (2-[4-(dimethylamino)phenylazo]benzoic acid) on a p-type Si substrate have been studied. The current-voltage characteristics of the device have rectifying behavior with a potential barrier formed at the interface. The barrier height and ideality factor values of 0.73eV and 3.22 for the structure have been obtained from the forward bias current-voltage (I-V) characteristics. The interface state energy distribution and their relaxation time have ranged from 1.68x10^1^2cm^-^2eV^-^1 and 1.68x10^-^3s in (0.73-E"v)eV to 1.80x10^1^2cm^-^2eV^-^1 and 5.29x10^-^5s in (0.43-E"v)eV, respectively, from the forward bias capacitance-frequency and conductance-frequency characteristics. Furthermore, the relaxation time of the interface states shows an exponential rise with bias from (0.43-E"v)eV towards (0.73-E"v)eV.
Video Display Terminals: Radiation Issues
Authors: William Murray
Venue: IEEE Computer Graphics and Applications (1984)

Though the controversy continues, the facts remain the same: VDT radiation levels are well below occupational exposure standards and biological injury thresholds. 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
Automatic Generation of Multi-Modal Dialogue from Text Based on Discourse Structure Analysis
Authors: Helmut Prendinger, Paul Piwek, Mitsuru Ishizuka
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper, we propose a novel method for generating engaging multi-modal content automatically from text. Rhetorical Structure Theory (RST) is used to decompose text into discourse units and to identify rhetorical discourse relations between them. Rhetorical relations are then mapped to question-answer pairs in an information preserving way, i.e., the original text and the resulting dialogue convey essentially the same meaning. Finally, the dialogue is "acted out" by two virtual agents. The network of dialogue structures automatically built up during this process, called DialogueNet, can be reused for other purposes, such as personalization or question-answering.
User rankings of search engine results
Authors: Judit Bar-Ilan, Kevin Keenoy, Eti Yaari, Mark Levene
Venue: Journal of the American Society for Information Science and Technology (2007)

In this study, we investigate the similarities and differences between rankings of search results by users and search engines. Sixty-seven students took part in a 3-week-long experiment, during which they were asked to identify and rank the top 10 documents from the set of URLs that were retrieved by three major search engines (Google, MSN Search, and Yahoo!) for 12 selected queries. The URLs and accompanying snippets were displayed in random order, without disclosing which search engine(s) retrieved any specific URL for the query. We computed the similarity of the rankings of the users and search engines using four nonparametric correlation measures in [0,1] that complement each other. The findings show that the similarities between the users' choices and the rankings of the search engines are low. We examined the effects of the presentation order of the results, and of the thinking styles of the participants. Presentation order influences the rankings, but overall the results indicate that there is no "average user," and even if the users have the same basic knowledge of a topic, they evaluate information in their own context, which is influenced by cognitive, affective, and physical factors. This is the first large-scale experiment in which users were asked to rank the results of identical queries. The analysis of the experimental results demonstrates the potential for personalized search.
A Bibliography on System Performance Evaluation
Authors: A. H. Agajanian
Venue: Computer (1975)

The measurement of computer performance is of interest to several classes of people associated with computers. Systems analysts, system designers, software designers, and users all have a continuing interest in the most effective techniques for quantifying the performance of the machines they build, program, and use. This bibliography of 440 references covering the period January 1970 to March 1975 was compiled to assist those working in the field.
Special Feature Computers in Clinical Medicine: a Critique
Authors: S. A. Glantz
Venue: Computer (1978)

In clinical medicine, computers are not an unmixed blessing. Sometimes their only observable effect is to drive up the costs of health care. 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
The t4sql temporal query language
Authors: Carlo Combi, Angelo Montanari, Giuseppe Pozzi
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Time characterizes every aspect of our life and its management when storing and querying data is very important. In this paper we propose a new temporal query language, called T4SQL, supporting multiple temporal dimensions of data. Besides the well-known valid and transaction times, it encompasses two additional temporal dimensions, namely, availability and event times. The availability time records when information is known and treated as true by the information system; the event times record the occurrence times of both the event that starts the valid time and the event that ends it. T4SQL is capable to deal with different temporal semantics (atemporal aka non-sequenced, current, sequenced, next) with respect to every temporal dimension. Moreover, T4SQL provides a novel temporal grouping clause and an orthogonal management of temporal properties when defining the selection condition(s) and the schema for the output relation.
Renovo: a hidden code extractor for packed executables
Authors: Min Gyung Kang, Pongsin Poosankam, Heng Yin
Venue: Proceedings of the 2007 ACM workshop on Recurring malcode (2007)

As reverse engineering becomes a prevalent technique to analyze malware, malware writers leverage various anti-reverse engineering techniques to hide their code. One technique commonly used is code packing as packed executables hinder code analysis. While this problem has been previously researched, the existing solutions are either unable to handle novel samples, or vulnerable to various evasion techniques. In this paper, we propose a fully dynamic approach that captures an intrinsic nature of hidden code execution that the original code should be present in memory and executed at some point at run-time. Thus, this approach monitors program execution and memory writes at run-time, determines if the code under execution is newly generated, and then extracts the hidden code of the executable. To demonstrate its effectiveness, we implement a system, Renovo, and evaluate it with a large number of real-world malware samples. The experiments show that Renovo is accurate compared to previous work, yet practical in terms of performance
Features Of Languages for the Development of Information Systems at the conceptual Level
Authors: A. Borgida
Venue: IEEE Software (1985)

Conceptual modeling languages make information systems easier to design and maintain by using vocabularies that relate naturally and directly to the 'real world" of many computer applications.