ppxscal/embedding_network huggingface dataset:
Perspectives on Requirements Understandability -- For Whom Does the Teacher's Bell Toll?
Authors: Mikael Svahnberg, Tony Gorschek, Magnus Eriksson, Andreas Borg, Kristian Sandahl, Jürgen Börster, Annabella Loconsole
Venue: Proceedings of the 2008 Requirements Engineering Education and Training (2008)

Software development decision makers use many different information sources as a basis for their decisions. One of these sources is the requirements specification, which is used in a large number of processes throughout the software development cycle. In order to make good decisions, the quality and completeness of the available information is important. Hence, requirements must be written in a way that is understandable for the different decision makers. However, requirements are rarely written with an explicit perception of how to make them understandable for different target usages. In this study we investigate the implicit assumptions of current and future requirements engineers and their teachers regarding which usages they perceive as most important when creating requirements. This is contrasted with industrial viewpoints of the relative importance of different requirements usages. The results indicate that the teachers and future requirements engineers have a strong focus towards in-project perspectives, and very little in common with the perspectives of industry managers. Thus, we are training students to serve as software developers, and not software engineering managers. Contact Author. The remainder of the author list is presented in alphabetical order of affiliation.
Spatial Auditory Interface for Word Processing Application
Authors: Jaka Sodnik, Sao Tomaic
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

In this paper we evaluate two different auditory interfaces for word processing application. The interfaces are in the form of hierarchical menu structures and use spatial sounds in two different spatial configurations. The first menu - AH - has a ring shaped horizontal configuration of the sound sources, whereas the second - AV - has a vertical configuration of the sound sources. Spatial sounds are used to increase the information flow between the user and the application. In this way, multiple sources (i.e. menu commands) can be played and perceived simultaneously. The main goal of the experiment was to choose the most efficient interface based on a user study with 16 test subjects. The test subjects were asked to perform five different tasks with two auditory interfaces and a normal visual GUI. The variables observed in the user study were: task completion times, navigation performance and various subjective evaluations. The AV interface proved to be the most efficient and user friendly and will therefore be used in further experiments.
Stability of some driving systems analyzed by means of roots geometric locus
Authors: Sorin Enache, Alexandru Bitoleanu, Monica Enache, Mircea Dobriceanu
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This paper analyzes the stability of the driving systems fitted out with asynchronous motors. In order to do this the used equations systems (written in the two axes theory) and the principle of the study method are presented. A Matlab program has been conceived with their help; this program has allowed to obtain some significant results and conclusions regarding the influences of the system parameters on stability.
Context adaptation of fuzzy systems through a multi-objective evolutionary approach based on a novel interpretability index
Authors: Alessio Botta, Beatrice Lazzerini, Francesco Marcelloni, Dan C. Stefanescu
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

Context adaptation (CA) based on evolutionary algorithms is certainly a promising approach to the development of fuzzy rule-based systems (FRBSs). In CA, a context-free model is instantiated to a context-adapted FRBS so as to increase accuracy. A typical requirement in CA is that the context-adapted system maintains the same interpretability as the context-free model, a challenging constraint given that accuracy and interpretability are often conflicting objectives. Furthermore, interpretability is difficult to quantify because of its very nature of being a qualitative concept. In this paper, we first introduce a novel index based on fuzzy ordering relations in order to provide a measure of interpretability. Then, we use the proposed index and the mean square error as goals of a multi-objective evolutionary algorithm aimed at generating a set of Pareto-optimum context-adapted Mamdani-type FRBSs with different trade-offs between accuracy and interpretability. CA is obtained through the use of specifically designed operators that adjust the universe of the input and output variables, and modify the core, the support and the shape of fuzzy sets characterizing the partitions of these universes. Finally, we show results obtained by using our approach on synthetic and real data sets.
Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China
Venue: ACM International Conference Proceeding Series; Vol. 368 (2008)

The first ACM Summit on Computing Education in China was held on 24th and 25th October 2008. The ACM China education summit represented an important initiative, one of the steps that ACM has taken to increase its relevance to computing in China. The Summit took place in the Royal King Hotel in Beijing immediately prior to the annual meeting of Chinese Deans and Heads of computing. ACM's goal in China is to help advance computing as a science and profession. The goals of this first education summit included the promotion of the discipline of computing, learning about good practices in computing education from within China, and where possible assisting in the enhancement of the quality of computing education in China. Twenty papers were submitted following a call for papers circulated throughout top-tier Chinese universities. The submissions told a very interesting story rebarding priorities and concerns within China. The reviewing process resulted in about 60% of the papers being accepted. There were also 4 high-quality keynote speakers: Xiaoming Li from Peking University; Frans Kashoeek from MIT; Jane Prey from Microsoft Research in the US; and Larry Snyder from the University of Washington, Seattle. John White, Chief Executive Officer of ACM, gave a presentation on "ACM and China."
Adaptable pipeline system with dynamic architecture
Authors: Svetlana P. Kartashev, Steven I. Kartashev
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper describes a pipeline system with dynamic architecture that performs cost-effective adaptations to the algorithm being executed. The system performs the following pipeline adaptations: (1) the number of stages in the pipeline changed to allow each instruction to activate the number of stages that matches the number of operations it realizes; (2) the operation sequences in the pipeline modified to allow any sequence of operations to execute without reconfiguration and thus eliminate the time overhead caused by this reconfiguration; and (3) the operation time in each stage adjusted to the minimum required for that operation because it may shorten the time of the total operation. This paper also discusses fast and flexible information exchanges between pipeline stages that can be done while the pipeline is working. Namely, each pipeline stage Ci may obtain during pipeline computations a temporary result that was computed by any other stage Cj. It is shown that such a pipeline may be organized from DC groups and thus be amenable to LSI implementation.
An Adversary Model for Simulation-Based Anonymity Proof
Authors: Yoshinobu Kawabe, Hideki Sakurada
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The use of a formal method is a promising approach to developing reliable computer programs. This paper presents a formal method for anonymity, which is an important security property of communication protocols with regard to a user's identity. When verifying the anonymity of security protocols, we need to consider the presence of adversaries. To formalize stronger adversaries, we introduce an adversary model for simulation-based anonymity proof. This paper also demonstrates the formal verification of a communication protocol. We employ Crowds, which is an implementation of an anonymous router, and verify its anonymity. After describing Crowds in a formal specification language, we prove its anonymity with a theorem prover.
A low-resource public-key identification scheme for RFID tags and sensor nodes
Authors: Yossef Oren, Martin Feldhofer
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

We revisit a public key scheme presented by Shamir in [19] (and simultaneously by Naccache in [15]) and examine its applicability for general-purpose RFID tags in the supply chain. Using a combination of new and established space-saving methods, we present a full-fledged public key identification scheme, which is secure yet highly efficient. The 1024-bit scheme fits completely (including RAM) into 4682 gate equivalents and has a mean current consumption of 14.2μA. The main novelty in our implementation is the replacement of the long pseudo-random sequence, originally stored on 260 bytes of EEPROM in [19], by a reversible stream cipher using less than 300 bits of RAM. We show how our scheme offers tag-to-reader and reader-to-tag authentication and how it can be fit into the existing RFID supply chain infrastructure.
Performance and power of cache-based reconfigurable computing
Authors: Andrew Putnam, Susan Eggers, Dave Bennett, Eric Dellinger, Jeff Mason, Henry Styles, Prasanna Sundararajan, Ralph Wittig
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

CHiMPS is a C-based compiler for high-performance computing (HPC) on heterogeneous CPU-FPGA computing platforms. CHiMPS efficiently supports random accesses to main memory through the many-cache memory model, enabling a broader range of applications to take advantage of FPGA-based acceleration. Many-cache creates multiple caches on top of an FGPA's small, independent memories, each targeting a particular data structure or region of memory in an application and each customized for the memory operations that access it. This poster presents the analyses and optimizations of the CHiMPS compiler that construct many-cache caches, and presents the details of the cache parameters on a Xilinx Virtex-5 LX110T FPGA. Detailed simulation results on HPC kernels demonstrate a 7.8x (geometric mean) performance boost over CPU-only execution of the same source code, FPGA power usage that is on average 4.1x less, and consequently performance per watt that is also greater, by a geometric mean of 21.3x.
LPL: a generalized list processing language
Authors: Billy G. Claybrook
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Many programming applications, e.g., symbolic and algebraic manipulation applications and artificial intelligence applications, require the use of list structures. Several list processing languages or languages that provide for list processing have been developed, e.g. LISP 1.5, LISP 2, SLIP, PL/1, ALGOL 68, etc. With the exception of ALGOL 68 and LISP 2, none of these languages provide the user with the capability to define the cell size and/or the configuration of the list cell at runtime (PL/1 attempts to do this with BASED structures but falls short because only one component in a BASED structure can have its dimension altered at runtime). ALGOL 68 has the disadvantage that it is not yet readily available for most users, and it suffers from list tracing complexities during garbage collection. LISP 2 was an attempt to allow variable cell configurations, but the project was aborted.
The vertex PI index and Szeged index of bridge graphs
Authors: Toufik Mansour, Matthias Schork
Venue: Discrete Applied Mathematics (2009)

Recently the vertex Padmakar-Ivan (PI"v) index of a graph G was introduced as the sum over all edges e=uv of G of the number of vertices which are not equidistant to the vertices u and v. In this paper the vertex PI index and Szeged index of bridge graphs are determined. Using these formulas, the vertex PI indices and Szeged indices of several graphs are computed.
Synthesis of networks on chips for 3D systems on chips
Authors: Srinivasan Murali, Ciprian Seiculescu, Luca Benini, Giovanni De Micheli
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Three-dimensional stacking of silicon layers is emerging as a promising solution to handle the design complexity and heterogeneity of Systems on Chips (SoCs). Networks on Chips (NoCs) are necessary to efficiently handle the 3D interconnect complexity. Designing power efficient NoCs for 3D SoCs that satisfy the application performance requirements, while satisfying the 3D technology constraints is a big challenge. In this work, we address this problem and present a synthesis approach for designing power-performance efficient 3D NoCs. We present methods to determine the best topology, compute paths and perform placement of the NoC components in each 3D layer. We perform experiments on varied, realistic SoC benchmarks to validate the methods and also perform a comparative study of the resulting 3D NoC designs with 3D optimized mesh topologies. The NoCs designed by our synthesis method results in large interconnect power reduction (average of 38%) and latency reduction (average of 25%) when compared to traditional NoC designs.
Ontology-aided Translation in the Comparison of Candidate Service Quality
Authors: Konstantinos Zachos, Glen Dobson, Pete Sawyer
Venue: Proceedings of the 2008 International Workshop on Service-Oriented Computing Consequences for Engineering Requirements (2008)

In engineering service-centric systems, it is possible to receive early feedback on candidate services that best match requirements. This includes the possibility of comparing the quality (not just functionality) of candidate services. This paper concentrates on the assessment of service quality at the requirements stage. In doing so, it is found that there is a problem in reaching a common understanding between the parties involved -- i.e. different service providers and requirements engineers may use different metrics, units, etc. We present an approach in which our requirements-based service discovery tool exploits an ontology-based quality specification mechanism. This simplifies the problem of reaching a common understanding of quality and allows translation where providers choose to specify quality differently.
On Recursive Calculation of M- and GM-Estimates by Direct Identification in LQG Control Systems
Authors: Nasko Atanasov, Rimantas Pupeikis
Venue: Informatica (2009)

In the previous papers (Pupeikis, 2000; Genov et al., 2006), a direct approach for estimating the parameters of a discrete-time linear time-invariant (LTI) dynamic system, acting in a closed-loop in the case of additive correlated noise with contaminating outliers uniformly spread in it, is presented. It is assumed here that the parameters of the LQG (Linear Quadratic Gaussian Control) controller are known beforehand. The aim of the given paper is development of a parametric identification approach for a closed-loop system when the parameters of an LTI system as well as that of LQG controller are not known and ought to be estimated. The recursive techniques based on an the M- and GM- estimator algorithms are applied here in the calculation of the system as well as noise filter parameters. Afterwards, the recursive parameter estimates are used in each current iteration to determine unknown parameters of the LQG-controller, too. The results of numerical simulation by computer are discussed.
Conceptual analysis of fuzzy data using FCA
Authors: Kyoung-Mo Yang, Eung-Hee Kim, Suk-Hyung Hwang, Sung-Hee Choi
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

In order to analyze vague data set of uncertainty information, Fuzzy Formal Concept Analysis(FFCA) incorporates fuzzy set theory into Formal Concept Analysis(FCA). It extracts useful information with a unit of fuzzy concept from given fuzzy formal context with a confidence threshold. Then it constructs fuzzy lattice by order relations between the fuzzy concepts. In this paper, we introduce basic notions of FCA and FFCA, and developed the Fuzzy Formal Concept Analysis Wizard(FFCA-Wizard), that supports FFCA's features. We demonstrate the process for discovering knowledge from uncertain data with our software, FFCA-Wizard. It can be applied some interesting areas such as traditional data mining, semantic web mining and so on.
Relaxed maximum a posteriori fault identification
Authors: Argyrios Zymnis, Stephen Boyd, Dimitry Gorinevsky
Venue: Signal Processing (2009)

We consider the problem of estimating a pattern of faults, represented as a binary vector, from a set of measurements. The measurements can be noise corrupted real values, or quantized versions of noise corrupted signals, including even 1-bit (sign) measurements. Maximum a posteriori probability (MAP) estimation of the fault pattern leads to a difficult combinatorial optimization problem, so we propose a variation in which an approximate maximum a posteriori probability estimate is found instead, by solving a convex relaxation of the original problem, followed by rounding and simple local optimization. Our method is extremely efficient, and scales to very large problems, involving thousands (or more) of possible faults and measurements. Using synthetic examples, we show that the method performs extremely well, both in identifying the true fault pattern, and in identifying an ambiguity group, i.e., a set of alternate fault patterns that explain the observed measurements almost as well as our estimate.
Scene Simulation Platform Based on Data Fusion of Multiple Format 3D Models
Authors: Gang Chen, Shang Xiang, GuanQun Ji, Quan Ding
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Scene simulation technology has been the basal component for building 3D simulation application now. Constructing a general scene simulation platform based on multiple format 3D models can greatly speed developing process of simulation application and promote developing efficiency. According to the idea above, a method of building scene simulation platform based on models data fusion is put forward. With this method, multiple 3D model data format such as FLT, 3DS, X, WRL and GLS are fused and driven by OpenGL API. The layered structure and framework based on HLA are also presented to design the platform. Key technologies involving model data fusion and simulation driving are detailed. Finally, challenges associating with realization of the platform named plug-in framework and simulation examples based on the platform are brought forward. It shows greatest traits on building similar large-scale simulation application system.
Think before you talk: an empirical study of relationship between speech pauses and cognitive load
Authors: M. Asif Khawaja, Natalie Ruiz, Fang Chen
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Measuring a user's level of cognitive load while they are interacting with the system could offer another dimension to the development of adaptable user interfaces. High levels of cognitive load affect performance and efficiency. However, current methods of measuring cognitive load are physically intrusive and interrupt the task flow. Certain speech features have been shown to change under high levels of load and are good candidates for cognitive load indices for usability evaluation and automatic adaptation of an interface or work environment. A speech-based dual-task user study is presented in which we explore the behaviour of speech pause features in natural speech. The experiment yielded new results confirming that speech pauses are useful indicators of high load versus low load speech. We report an increase in the percentage of time spent pausing from low load to high load tasks. We interpret these results within the framework of Baddeley's modal model of working memory and detail how such a measure could be utilized in the cognitive load measurement.
EA-Analyzer: a tool for identifying conflicting dependencies in requirements documents
Authors: Alberto Sardinha, Awais Rashid, Ruzanna Chitchyan, Nathan Weston, Phil Greenwood
Venue: Proceedings of the 15th workshop on Early aspects (2009)

Aspect-oriented requirements engineering is a promising approach to early aspects, and its main goal is to address the composability and subsequent analysis of crosscutting concerns during requirements engineering. The goal is to reveal aspect influences and mutual tradeoffs among aspects before the architecture is derived. An important step towards the effective analysis of early aspects is to provide tools for mining aspects in requirements document, and inferring dependencies and trade-offs among broadly-scoped concerns. However, to date, current techniques for the analysis of early aspects have mainly been limited to techniques for mining aspects using natural language processing or information retrieval. The analysis of inferences and trade-offs are still being done manually with visual inspection. EA-Analyzer is a tool for indentifying conflicting dependencies that are contained within a requirements document. The tool is an application of a Bayesian learning method, and offers early insights into architectural trade-offs.
Accelerated Publication: A resist for electric imprint lithography
Authors: Yong Sik Ahn, Yong Chen, H. Thomas Hahn
Venue: Microelectronic Engineering (2009)

An electrically curable resist has been developed that can make electric imprint lithography (EIL) a reality. The resist is composed of a diaryliodonium salt photo acid generator and a cycloaliphatic epoxy monomer. Its polymerization takes place when an electric potential is applied between a conductive imprint mold and a substrate which sandwich the resist. A proof-of-concept pattern transfer by EIL with a micron-scale resolution has been demonstrated.
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
Authors: Simon J. Puglisi, Andrew Turpin
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The suffix array, a space efficient alternative to the suffix tree, is an important data structure for string processing, enabling efficient and often optimal algorithms for pattern matching, data compression, repeat finding and many problems arising in computational biology. An essential augmentation to the suffix array for many of these tasks is the Longest Common Prefix (LCP) array. In particular the LCP array allows one to simulate bottom-up and top-down traversals of the suffix tree with significantly less memory overhead (but in the same time bounds). Since 2001 the LCP array has been computable in &theta;(n) time, but the algorithm (even after subsequent refinements) requires relatively large working memory. In this paper we describe a new algorithm that provides a continuous space-time tradeoff for LCP array construction, running in O(nv) time and requiring $n + O(n/\sqrt{v} + v)$ bytes of working space, where v can be chosen to suit the available memory. Furthermore, the algorithm processes the suffix array, and outputs the LCP, strictly left-to-right, making it suitable for use with external memory. We show experimentally that for many naturally occurring strings our algorithm is faster than the linear time algorithms, while using significantly less working memory.