ppxscal/embedding_network huggingface dataset:
An Adaptive Software Framework based on Service Composition
Authors: Chanwoo Yoo, Woosung Jung, Donghun Park, Byungjeong Lee, Heechern Kim, Chisu Wu
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Adaptive software needs to select most appropriate solution among multiple ways to accomplish a goal as its environment changes dynamically. This uncertainty of environment and solution makes hard to design adaptive software. Further, diversity of adaptation granularity makes architecture of adaptive software more complicated. Coordination problem between adaptive software is also an important issue. In this paper, we present a service based adaptive software framework which resolves these issues.
A Task Allocation Model for Distributed Computing Systems
Authors: Perng-Yi Richard Ma
Venue: IEEE Transactions on Computers (1982)

This paper presents a task allocation model that allocates application tasks among processors in distributed computing systems satisfying: 1) minimum interprocessor communication cost, 2) balanced utilization of each processor, and 3) all engineering application requirements.
Author's Reply2
Authors: A. L. Rosenberg
Venue: IEEE Transactions on Computers (1986)

Professor Koren's comments on my paper raise a number of points that merit more attention than they typically receive in the literature.
Reconfigurable Control Structure for Robots in Assembly
Authors: Yang Cao, Hoda A. Elmaraghy, Ahmed Azab
Venue: Journal of Intelligent and Robotic Systems (2007)

The increased use of changeable characteristics in modern manufacturing and robotic systems and applications call for improved system control design that offers some degree of reconfigurability. The need for control reconfiguration of robotic systems arises due to some inherent characteristics of the robotic system, variations of robot parameters due to environmental changes, major task changes typical in production changeover or manufacturing system reconfiguration, or geometry changes due to the reconfiguration of modular manipulators. In this paper, a reconfigurable controller, the Supervisory Control Switching System (SCSS), is proposed to meet the new on-line demands for changeability in robotic systems. The SCSS is capable of selecting the most suitable controller for a particular task or situation, from separate controllers designed a priori. The applicability and effectiveness of the developed switching control scheme have been illustrated through computer simulations of an AdeptOne SCARA manipulators carrying out assembly tasks.
State-oriented Noninterference for CCS
Authors: Ilaria Castellani
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We address the question of typing noninterference (NI) in the calculus CCS, in such a way that Milner's translation into CCS of a standard parallel imperative language preserves both an existing NI property and the associated type system. Recently, Focardi, Rossi and Sabelfeld have shown that a variant of Milner's translation, restricted to the sequential fragment of the language, maps a time-sensitive NI property to that of Persistent Bisimulation-based Non Deducibility on Compositions (PBNDC) on CCS. However, since CCS was not equipped with a type system, the question of whether the translation preserves types could not be addressed. We extend Focardi, Rossi and Sabelfeld's result by showing that a slightly simpler variant of Milner's translation preserves a time-insensitive NI property on the full parallel language, by mapping it again to PBNDC. As a by-product, we formalise a folklore result, namely that Milner's translation preserves a behavioural equivalence on programs. We present a simple type system ensuring PBNDC on CCS, inspired by existing type systems for the @p-calculus. Unfortunately, this type system as it stands is too restrictive to grant the expected type preservation result. We sketch a solution to overcome this problem.
Gate level multiple supply voltage assignment algorithm for power optimization under timing constraint
Authors: Jun Cheng Chi, Hung Hsie Lee, Sung Han Tsai, Mely Chen Chi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

We propose a multiple supply voltage scaling algorithm for low power designs. The algorithm combines a greedy approach and an iterative improvement optimization approach. In phase I, it simultaneously scales down as many gates as possible to lower supply voltages. In phase II, a multiple way partitioning algorithm is applied to further refine the supply voltage assignment of gates to reduce the total power consumption. During both phases, the timing correctness of the circuit is maintained. Level converters (LCs) are adjusted correctly according to the local connectivity of the different supply voltage driven gates. Experimental results show that the proposed algorithm can effectively convert the unused slack of gates into power savings. We use two of the ISPD2001 benchmarks and all of the ISCAS89 benchmarks as test cases. The 0.13-µm CMOS TSMC library is used. On average, the proposed algorithm improves the power consumption of the original design by 42.5% with a 10.6% overhead in the number of LCs. Our study shows that the key factor in achieving power saving is including the most comportable supply voltage in the scaling process.
Nearcast: A locality-aware P2P live streaming approach for distance education
Authors: Xuping Tu, Hai Jin, Xiaofei Liao, Jiannong Cao
Venue: ACM Transactions on Internet Technology (TOIT) (2008)

Peer-to-peer (P2P) live video streaming has been widely used in distance education applications to deliver the captured video courses to a large number of online students. By allowing peers serving each other in the network, P2P technology overcomes many limitations in the traditional client-server paradigm to achieve user and bandwidth scalabilities. However, existing systems do not perform well when the number of online students increases, and the system performance degrades seriously. One of the reasons is that the construction of the peer overlay in existing P2P systems has not considered the underlying physical network topology and can cause serious topology mismatch between the P2P overlay network and the physical network. The topology mismatch problem brings great link stress (unnecessary traffic) in the Internet infrastructure and greatly degrades the system performance. In this article, we address this problem and propose a locality-aware P2P overlay construction method, called Nearcast, which builds an efficient overlay multicast tree by letting each peer node choose physically closer nodes as its logical children. We have conducted extensive simulations to evaluate the performance of Nearcast in comparison with the existing RTT and NICE protocols. Also, Nearcast has been deployed on a wide-area network testbed to delivery video coursed to about 7200 users distributed across 100 collages in 32 cities in China. The experimental results show that Nearcast leads to lower link stress and shorter end-to-end latencies compared with the RTT and NICE protocols.
AWESOME: a data warehouse-based system for adaptive website recommendations
Authors: Andreas Thor, Erhard Rahm
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many factors and is largely unknown. We propose a new classification of recommenders and comparatively evaluate their relative quality for a sample web-site. The evaluation is performed with AWESOME (Adaptive website recommendations), a new data warehouse-based recommendation system capturing and evaluating user feedback on presented recommendations. Moreover, we show how AWESOME performs an automatic and adaptive closed-loop website optimization by dynamically selecting the most promising recommenders based on continuously measured recommendation feedback. We propose and evaluate several alternatives for dynamic recommender selection including a powerful machine learning approach.
From Functional to Fun: End User Development for Teenagers
Authors: Sarita Yardi
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Teenagers describe their perceptions of computing as boring, anti-social, and irrelevant to their lives. We are working on a broadening participation in computing project to portray computing as an innovative, creative, and challenging field with authentic, real-world applications. We have developed an Introduction to HCI course for teenagers in which they will participate in design-based projects using end user development tools on the web. The increasing availability of web-based software for creating mashups offers an opportunity to engage teenagers in computing by meeting them in their existing informal and fun environments on the web.
A Procedure for Generating Batch-Means Confidence Intervals for Simulation: Checking Independence and Normality
Authors: E. Jack Chen, W. David Kelton
Venue: Simulation (2007)

Batch means are sample means of subsets of consecutive subsamples from a simulation output sequence. Independent and normally distributed batch means are not only the requirement for constructing a confidence interval for the mean of the steady-state distribution of a stochastic process, but are also the prerequisite for other simulation procedures such as ranking and selection (R&#x0026;S). We propose a procedure to generate approXimately independent and normally distributed batch means, as determined by the von Neumman test of independence and the chi-square test of normality, and then to construct a confidence interval for the mean of a steady-state eXpected simulation response. It is our intention for the batch means to play the role of the independent and identically normally distributed observations that confidence intervals and the original versions of R&#x0026;S procedures require. We perform an empirical study for several stochastic processes to evaluate the performance of the procedure and to investigate the problem of determining valid batch sizes.
A Fuzzy Classification Model with SVM
Authors: Aimin Yang, Xinguang Li, Yongmei Zhou, Lingmin Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A fuzzy classification model with support vector machine (FCMWSVM) is proposed. For the basic idea of constructing this model, firstly the kernel function is constructed by selecting suitable membership function. Then a fuzzy partition is built around each training pattern and a fuzzy IF-THEN classification rule is defined for each fuzzy partition. Finally, the support vectors and the parameters for rule are got by SVM learning method. The basic idea and the structure of this model are introduced. The effects of the membership function parameters and the penalty parameters for the classification rule and the classifier performance are analyzed.Experiments with two-spiral line data and typical data sets evaluate the performances of this model
Users and Vendors Evaluate the Current Status and Future Prospects of CAD/CAM
Venue: IEEE Computer Graphics and Applications (1984)

Assessment of in-place CAD/CAM systems helps potential users define their goals and achieve a high return on investment. 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
WEB Image Classification Based on the Fusion of Image and Text Classifiers
Authors: P. Kalva, F. Enembreck, A. Koerich
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents a novel method for the classifica- tion of images that combines information extracted from the images and contextual information. The main hypoth- esis is that contextual information related to an image can contribute in the image classification process. First, inde- pendent classifiers are designed to deal with images and text. From the images color, shape and texture features are extracted. These features are used with a neural network (NN) classifier to carry out image classification. On the other hand, contextual information is processed and used with a Na¨ive Bayes (NB) classifier. At the end, the outputs of both classifiers are combined through heuristic rules. Ex- perimental results on a database of more than 5,000 HTML documents have shown that the combination of classifiers provides a meaningful improvement (about 16%) in the cor- rect image classification rate relative to the results provided by the NN classifier alone.
Learning on the border: active learning in imbalanced data classification
Authors: Seyda Ertekin, Jian Huang, Leon Bottou, Lee Giles
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper is concerned with the class imbalance problem which has been known to hinder the learning performance of classification algorithms. The problem occurs when there are significantly less number of observations of the target concept. Various real-world classification tasks, such as medical diagnosis, text categorization and fraud detection suffer from this phenomenon. The standard machine learning algorithms yield better prediction performance with balanced datasets. In this paper, we demonstrate that active learning is capable of solving the class imbalance problem by providing the learner more balanced classes. We also propose an efficient way of selecting informative instances from a smaller pool of samples for active learning which does not necessitate a search through the entire dataset. The proposed method yields an efficient querying system and allows active learning to be applied to very large datasets. Our experimental results show that with an early stopping criteria, active learning achieves a fast solution with competitive prediction performance in imbalanced data classification.
Sequence-based specification of feedback control systems in Simulink&reg;
Authors: Jason M. Carter, Jesse H. Poore
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Solid-state microprocessors with software controlled sensors and actuators have essentially replaced analog control systems. Design systems with extensive libraries and code generators such as the ETAS&reg; ASCET and MATLAB&reg;/Simulink are widely used in industry to design control systems. However. the software engineering methods to help get the design right are missing. Sequence-based specification is a rigorous method that is well suited to the design of embedded control systems. This paper focuses on the adaptation of sequence-based specification to Simulink blocks, feedback control, and state machine generation, while preserving the ability to convert ordinary requirements to precise state-machine specifications.
Modeling and Performance Analysis of LFSN
Authors: Xianhai Tan, Ying Hu, Weidong Jin
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

There is much experimental evidence that network traffic processes exhibit ubiquitous properties of selfsimilarity and long-range dependence (LRD). Modeling and performance evaluation of self-similar traffic is a research hotspot of computer network . The most commonly used model of self-similar traffic is Fractional Brownian Motion (FBM) process, which can only capture the self-similar and long-range dependent characteristics of the traffic. Recent experimental studies have shown that several traffic classes of real traffic exhibit higher variability than that captured by FBM model. In this paper, a fractional stable motion self-similar model, Linear Fractional Stable Noise (LFSN), which can capture both long-range dependent and bursty (heavy-tail) characteristics of the traffic, is studied. Based on the buffer size overflow given by the predecessors, the formulae of average queue length, queue length variance, average delay, jitter and effective bandwidth are derived. The variation of packet loss rate, average delay and effective bandwidth with the parameters of Hurst parameter, characteristic exponent and buffer size is investigated through simulation.
The Theory and Practice of Foundation Testing
Authors: W. E. Howden
Venue: IEEE Software (1985)

Viewing programs as syntheses of requirements, design, and programming functions allows programmers to address a wide variety of errors even subtle and difficult-to-find missing code faults.
Analysis of interface states and series resistance of MIS Schottky diodes using the current-voltage (I-V) characteristics
Authors: A. Tataroğlu, Ş. Altındal
Venue: Microelectronic Engineering (2008)

The purpose of this paper is to analyze interface states in Al/SiO"2/p-Si (MIS) Schottky diodes and determine the effect of SiO"2 surface preparation on the interface state energy distribution. The current-voltage (I-V) characteristics of MIS Schottky diodes were measured at room temperature. From the I-V characteristics of the MIS Schottky diode, ideality factor (n) and barrier height (@F"B) values of 1.537 and 0.763eV, respectively, were obtained from a forward bias I-V plot. In addition, the density of interface states (N"s"s) as a function of (E"s"s-E"v) was extracted from the forward bias I-V measurements by taking into account both the bias dependence of the effective barrier height (@F"e), n and R"s for the MIS Schottky diode. The diode shows non-ideal I-V behaviour with ideality factor greater than unity. In addition, the values of series resistance (R"s) were determined using Cheung's method. The I-V characteristics confirmed that the distribution of N"s"s, R"s and interfacial insulator layer are important parameters that influence the electrical characteristics of MIS Schottky diodes.
Automatic SQL tuning in oracle 10g
Authors: Benoit Dageville, Dinesh Das, Karl Dias, Khaled Yagoub, Mohamed Zait, Mohamed Ziauddin
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

SQL tuning is a very critical aspect of database performance tuning. It is an inherently complex activity requiring a high level of expertise in several domains: query optimization, to improve the execution plan selected by the query optimizer; access design, to identify missing access structures; and SQL design, to restructure and simplify the text of a badly written SQL statement. Furthermore, SQL tuning is a time consuming task due to the large volume and evolving nature of the SQL workload and its underlying data. In this paper we present the new Automatic SQL Tuning feature of Oracle 10g. This technology is implemented as a core enhancement of the Oracle query optimizer and offers a comprehensive solution to the SQL tuning challenges mentioned above. Automatic SQL Tuning introduces the concept of SQL profiling to transparently improve execution plans. It also generates SQL tuning recommendations by performing cost-based access path and SQL structure "what-if" analyses. This feature is exposed to the user through both graphical and command line interfaces. The Automatic SQL Tuning is an integral part of the Oracle's framework for self-managing databases. The superiority of this new technology is demonstrated by comparing the results of Automatic SQL Tuning to manual tuning using a real customer workload.
Metric Analysis and Data Validation Across Fortran Projects
Authors: V. R. Basili
Venue: IEEE Transactions on Software Engineering (1983)

The desire to predict the effort in developing or explain the quality of software has led to the proposal of several metrics in the literature. As a step toward validating these metrics, the Software Engineering Laboratory has analyzed the Software Science metrics, cyclomatic complexity, and various standard program measures for their relation to 1) effort (including design through acceptance testing), 2) development errors (both discrete and weighted according to the amount of time to locate and frix), and 3) one another. The data investigated are collected from a production Fortran environment and examined across several projects at once, within individual projects and by individual programmers across projects, with three effort reporting accuracy checks demonstrating the need to validate a database. When the data come from individual programmers or certain validated projects, the metrics' correlations with actual effort seem to be strongest. For modules developed entirely by individual programmers, the validity ratios induce a statistically significant ordering of several of the metrics' correlations. When comparing the strongest correlations, neither Software Science's E metric, cyclomatic complexity nor source lines of code appears to relate convincingly better with effort than the others
Performance Evaluation of Traffic Mix in IP Based Networks
Authors: Norrozila Sulaiman, Rolando Carrasco, Graeme Chester
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

With the convergence of mobile telephony and the Internet, it seems that future telephony data will be transferred on VoIP datagram. Mobility will affect the overall system performance especially for voice communication. Thus, maintaining the quality of voice is necessary. It is important to guarantee that the end-to-end delay must be kept at a certain level. This paper investigates the performance of voice in traffic mix environment. Handover which is based on incoming traffics may cause the system to be unbalanced. A load balancing scheme was deployed to optimise the system capacity and to improve performance. The throughput, end-to-end delay and packet loss are used in measuring the performance. The results show that a better performance can be achieved by deploying this scheme. In addition, the system is able to support more number of connected users.
Clues for Modeling and Diagnosing Open Faults with Considering Adjacent Lines
Authors: Hiroshi Takahashi, Yoshinobu Higami, Shuhei Kadoyama, Takashi Aikyo, Yuzo Takamatsu
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Under the modern manufacturing technologies, the open defect is one of the significant issues to maintain the reliability of DSM circuits. However, the modeling and techniques for test and diagnosis for open faults have not been established yet. In this paper, we give an important clue for modeling an open fault with considering the affects of adjacent lines. Firstly, we use computer simulations to analyze the defective behaviors of a line with the open defect. From the simulation results, we propose a new open fault model that is excited depending on the logic values at the adjacent lines assigned by a test. Next, we propose a diagnosis method that uses the pass/fail information to deduce the candidate open fault. Finally, experimental results show that the proposed method is able to diagnose the open faults with good resolution. It takes about 6 minutes to diagnose the open fault on the large circuit (2M gates).