ppxscal/embedding_network huggingface dataset:
A New Way of Automatic Design of Software (Simulating Human Intentional Activity)
Authors: Zenya Koono, Hassan Abolhassani, Hui Chen
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

This paper reports on a new method of automatic design. It is a simulation of “human intentional activity,” appearing in management, business, various designs and physical work. It is achieved by repetitive hierarchical decomposition of human concepts using (mainly) natural language expressions. Three typical ways (skill, rule and knowledge based) to create the hierarchical decomposition have been implemented and evaluated quantitatively as a CASE tool. The rule-level operation achieves nearly 100% automatic detailing.
A goal programming mixed-model line balancing for processing time and physical workload
Authors: Gyunghyun Choi
Venue: Computers and Industrial Engineering (2009)

In this paper, we present a new mathematical model of line balancing for processing time and physical workload at the same time. Line balancing is the problem to assign tasks to stations while satisfying some managerial viewpoints. Most researches about the line balancing problems are focused on the conventional industrial measures that minimizing total processing time and/or number of workstations. Also, independently, some research reports insist some industrial ergonomic issues to be considered for balancing. So, we propose a zero-one integer program model that combines the overload of processing time and physical workload with various risk elements. For the solution techniques, we adopt the goal programming approach and design an appropriate algorithm process. Various computational test runs are performed on the processing time only model, the physical workload only model, and the integrated model. Comparing the pay-offs between the two overloads, test results show us that well balanced job allocation is able to be obtained through the proposed model. And we conclude that the model may be very useful for the operation managers to make decisions on their job scheduling efforts.
Implementing and analyzing in Maude the Enhanced Interior Gateway Routing Protocol
Authors: Adrián Riesco, Alberto Verdejo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance-vector routing protocol, with optimizations to minimize both the routing instability incurred after topology changes, as well as the use of bandwidth and processing power in the router. This paper presents an executable specification using the rewriting logic based language Maude, that allows to connect several running instances of the protocol and on top of which concrete applications can be executed. The protocol is also modeled in Real-Time Maude, which allows to formally analyze it in several ways.
An Exploration of the Effects of State Granularity through (m, k) Real-Time Streams
Authors: Yingxin Jiang, Aaron Striegel
Venue: IEEE Transactions on Computers (2009)

Real-time media servers are becoming increasingly important as the Internet supports more and more multimedia applications. In order to meet these ever increasing demands, real-time media servers will be responsible for supporting a large number of clients with a wide range of QoS requirements. While techniques to aggregate state information for scalability have been proposed in the literature such as with Differentiated Services; the per-stream effects of such aggregation are poorly understood. Based on the (m,k)-firm model to schedule loss-tolerant streams, we explore the effects of aggregated state information in this paper and describe our scheme, called Granularity Aware (m,k) Queue Management (GAQM). GAQM improves control over the tradeoff between scalability and per-stream QoS performance. Specifically, we identify the necessity of balancing aggregation groups according to characteristics such as relative deadlines. Another key finding of this work is that with proper biasing, the inaccuracy of aggregate state lends itself to burst scheduling rather than simply extending traditional scheduling mechanisms. This finding is profound in that the result is counterintuitive: less frequent scheduling leads to increased per-stream performance. We present detailed examples of GAQM and evaluate our work through simulation studies and Markov chain analysis.
Design of controller on synchronization of chaotic neural networks with mixed time-varying delays
Authors: Qiankun Song
Venue: Neurocomputing (2009)

In this paper, the problem on synchronization is investigated for neural networks with discrete and distributed time-varying delays as well as generalized activation functions. By constructing proper Lyapunov-Krasovskii functional and employing a combination of the free-weighting matrix method, Newton-Leibniz formulation and inequality technique, the controllers are, respectively, designed to achieve the asymptotical and exponential synchronization of the addressed neural networks. The provided conditions are expressed in terms of LMIs, and are dependent on both the discrete and distributed time delays. A simulation example is given to show the effectiveness and less conservatism of the obtained conditions. It is noteworthy that the traditional assumptions on the differentiability of the time-varying delays and the boundedness of its derivative are removed.
Towards a simple service compiler
Authors: Emre Kıcıman
Venue: Proceedings of the 6th international conference industry session on Autonomic computing and communications industry session (2009)

Over the last 10-15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges in performance, reliability, and scalability. To address these challenges, developers consistently draw from a relatively small repertoire of software architecture design patterns or best practices, such as replication, tiering, pre-computation, and caching. The application of these techniques across different services, however, varies significantly in both their design and implementation. There is, however, a good reason for this variation in implementation; their effectiveness depends heavily on the service's semantic requirements, its workloads, performance and other runtime and environmental characteristics. The implication is that taking advantage of today's best practices and design patterns requires that developers have a deep, end-to-end understanding of their service's functionality, workloads, and system infrastructure. Our insight is that most of this critical information is directly measurable, and, in this presentation, discuss our research towards building a system, analogous to a profile-driven optimizing compiler, that separates architectural decisions to support performance, reliability, and scalability from service functionality.
A comprehensive decision making structure for partitioning of make-to-order, make-to-stock and hybrid products
Authors: N. Zaerpour, M. Rabbani, A. H. Gharehgozli, R. Tavakkoli-Moghaddam
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Manufacturing systems produce their products by making use of three main strategies: make-to-order, make-to-stock and hybrid (combination of MTO and MTS strategies) systems. Hence, several products must be considered and partitioned in terms of many different conflicting criteria, leading to a large set of subjective or ambiguous data. Thus, an effective evaluation approach is essential to improve decision quality. In this paper a comprehensive decision, making structure is proposed to choose the proper strategy for producing the products. It consists of a novel hybrid methodology, which combines analytical hierarchy process (AHP) and technique for order performance by similarity to ideal solution (TOPSIS) for partitioning of products. In this study, the rating of each alternative regarding different criteria (throughout the TOPSIS technique) is described by means of linguistic variables. Furthermore, fuzzy AHP methodology is applied to determine the weights of evaluation criteria. At the end, the effectiveness of the proposed model is demonstrated through a case study.
On the Edge: A Comprehensive Guide to Blade Server Technology
Authors: Kiran Mani, Bradley Jee
Venue:  (2007)

"Technology infrastructure decisions always carry some degree of uncertainty- from large corporations down to small and medium businesses. Straight to the Point will help companies to understand more about Blade Servers and assist them in determining if Blade Servers are right for their organization. This book is definitely a must read for any IT Manager thinking about Blade Servers." --Chris Perrine, COO & EVP of Sales & Marketing, Springboard Research "Blade server computing combined with virtualization technology introduces a new data center paradigm where the potential values to the enterprise are limitless, and fear not; Straight to the Point' is here to get you started on a journey you won't look back!" --William Wu, Asia Pacific Server Manager, Intel Corporation "Searching for right technology to suit your business, while being fully aware of technology's dynamic and rapid evolution, is much like a search for the Holy Grail. 'Straight to the Point' illuminates your path. However, you will still need the courage to make your own decisions." --Alok Ohrie, Managing Director, AMD India "IDC believes that blades will become the next big battleground for server vendors, which means more innovation and better value for end-users. It is a platform that is focused on addressing tomorrow's problem for the endusers. This book provides great commentary in a simple language to illustrate the benefits of deploying blades. The real life customer examples further helps to communicate the value-proposition of this innovative form factor." --Avneesh Saxena, Vice President, Asia/Pacific Systems,Storage and Software Research IDC "With processors getting more and more powerful, the importance of leveraging the available computing power to get more out of it has become essential for every business. Blade servers with its amazing ability to onsolidate and virtualise is just the thing that many a CIO is looking for. Straight to the point on Blade Servers is a wealth of simple yet important information that will help entreprenuers make a business decision with their IT infrastructure" --Mike Clayville, Vice-President, Asia Pacific and Japan VMware
The optimal design of the quality management concepts using mathematical modeling techniques
Authors: Ioana Maria Diana Sandru
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

Within this paper the broad concept of "quality" is mathematically modeled by means of the engineering notion of dynamic system. This view point facilitates the mathematical approach of those issues concerned with reaching set quality standards. Supplementary, the final part of the article will present an application of the constructed model by indicating strategies of optimal projections for two distinct and broad categories of issues concerning the quality theory.
Worst-case efficient range search indexing: invited tutorial
Authors: Lars Arge
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

In this tutorial we will describe some of the recent advances in the development of worst-case efficient range search indexing structures, that is, structures for storing a set of data points such that the points in a axis-parallel (hyper-) query rectangle can be found efficiently (with as few disk accesses - or I/Os - as possible). We first quickly discuss the well-known and optimal structure for the one-dimensional version of the problem, the B-tree [10, 12], along with its variants weight-balanced B-trees [9], multi-version (or persistent) B-trees [6, 11, 13, 22] and buffer-trees [4]. Then we discuss the external priority search tree [8], which solves a restricted version of the two-dimensional version of the problem where the query rectangle is unbounded on one side. This structure is then used in a range tree index structure [8, 21] that answers general two-dimensional queries in the same number of I/Os as the B-tree in the one-dimensional case, but using super-linear space. We also describe the linear space kdB-tree [19, 20] and O-tree [17] index structures that also solve the problem efficiently (but using more I/Os than the range tree). A detailed presentation of all the the above structures can be found in lecture notes by the author [5]. Finally, we also discuss lower bounds techniques, most notably the theory of indexability [16], that can be used to prove that both the range tree and kdB-tree/O-tree are optimal among query efficient and linear space structures, respectively [2, 8, 17], as well as recent index structures for higher-dimensional range search indexing [1]. We end by mentioning various R-tree variant [7, 18, 15] that can be used to solve the extended version of range search indexing where the queries as well as the data are (hyper-) rectangles. More comprehensive surveys of efficient index structures can be found in [3, 14, 23].
Incorporating Relational Data into the Semantic Web- Fronal.OWLom Databases to RDF using Relational.OWL
Authors: Cristian Prez de Laborda Schwankhart
Venue:  (2007)

Relational.OWL is a technique to automatically convert a relational database into a Semantic Web representation, enabling Semantic Web applications to access data actually stored in relational databases using their own built-in functionality. Since this representation does not result in objects containing real semantics, we additionally show how to create mappings from the relational model to a target ontology using an arbitrary closed RDF query language. Using current Semantic Web techniques, a formerly relational data item, once converted to its Semantic Web representation, can neither be identified unambiguously, nor be backtracked to its original storage location in the relational database. We hence introduce a novel URI scheme for identifying not only databases, but also their schema and data components like tables or columns, giving us the possibility to specify the exact and identifying storage location of any data item in its original data source. 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
Mental models of recursive computations vs. recursive analysis in the problem domain
Authors: Claudio Mirolo
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

The work outlined here was inspired by [1, 3], where the authors analyze the mental models of recursion by looking at how students trace simple recursive computations. Besides trying to understand if their results generalize to a different context, I was interested to see the correlations between the mental models of the computation process and the ability to establish recursive relationships in the problem domain. My investigation essentially lends further support to the findings of [3]. However, a consistent mental model of recursive computations, although implied by the ability to use recursion in problem-solving, does not seem to be sufficient for the achievement of this higher-level skill.
The grid observatory
Authors: Charles Loomis
Venue: Proceedings of the 6th international conference industry session on Grids meets autonomic computing (2009)

Scientific communities worldwide have set up massive grids that manage several tens of thousands of CPUs and several PetaBytes of storage space. The control and maintenance of these complex systems remain a significant operational challenge. Application developers need synthetic characterizations of the grid activity and the grid applications for predicting and optimizing application performance. Grid models are required for dimensioning, capacity planning, and middleware design. The goal of the Grid Observatory project (GO) is to contribute to an experimental theory of large grid systems by integrating the collection of data on the behavior of the EGEE grid and users, the development of models, and an ontology for the domain knowledge. Autonomic computing is highly relevant to grid systems, especially at a time where production grids have to move to sustainable infrastructures, with implications on the volume and structure of the manpower dedicated to the day-to-day operations. The specific Autonomic Computing goals of the GO are Self-Optimization, Self-Healing, and to some extent Self-Configuration.
Speed encoding in correlation motion detectors as a consequence of spatial structure
Authors: Andrew Isaac Meso, Johannes M. Zanker
Venue: Biological Cybernetics (2009)

For animals to carry out a wide range of detection, recognition and navigation tasks, visual motion signals are crucial. The encoding of motion information has therefore, attracted much attention in the experimental and computational study of brain function. Two main alternative mechanisms have been proposed on the basis of behavioural and physiological experiments. On one hand, correlation-type and motion energy detectors are simple and efficient in the design of their basic mechanism but are tuned to temporal frequency rather than to speed. On other hand, gradient-type motion detectors directly represent an estimate of speed, but may require more demanding processing mechanisms. We demonstrate here how the temporal frequency dependence observed for sine-wave gratings can disappear for less constrained stimuli, to be replaced by responses reflecting speed for stimuli like square waves when a phase-sensitive detection mechanism is employed. We conclude from these observations that temporal frequency tuning is not necessarily a limitation for motion vision based on correlation detectors, and more generally demonstrate in view of the typical Fourier composition of natural scenes, that correlation detectors operating in such environments can encode image speed. In the context of our results, we discuss the implications of the loss of phase sensitivity inherent in using a linear system approach to describe neural processing.
A novel control strategy for dynamic voltage restorer using decoupled multiple reference frame PLL (DMRF-PLL)
Authors: Lin Xu, Yang Han, M. M. Khan, Lidan Zhou, Gang Yao, Chen Chen, Jumin Pan
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

This paper presents a new control scheme for dynamic voltage restorer (DVR), which consists of a set of series and shunt converters connected back-to-back (BTB), three series transformers, and a dc capacitor installed on the common dc-link. The DVR is characterized by installing the shunt converter on the source side and the series converter on the load side. A decoupled multiple reference frame phase-locked-loop (DMRFPLL) is proposed, which decouples signals of different frequencies and eliminates interactions between the fundamental-frequency positive-sequence components and harmonic and/or negative-sequence components in the grid voltages. The proposed DMRF-PLL scheme achieves a fast, precise, and robust positive-sequence voltage detection even under unbalanced and/or distorted grid voltages conditions. A detailed description and derivation of the detection method is presented. Besides, a separate proportional-integral (PI) controller is adopted to regulate the dc-link capacitor voltage. The load voltage waveform is restored to be sinusoidal with fundamental frequency by dynamically injecting compensating voltages to the series brunch of converters. The validity and effectiveness of the presented scheme has been confirmed by extensive simulation results obtained from a 380V/50kVA system using Matlab/Simulink.
BBM: bayesian browsing model from petabyte-scale data
Authors: Chao Liu, Fan Guo, Christos Faloutsos
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Given a quarter of petabyte click log data, how can we estimate the relevance of each URL for a given query? In this paper, we propose the Bayesian Browsing Model (BBM), a new modeling technique with following advantages: (a) it does exact inference; (b) it is single-pass and parallelizable; (c) it is effective. We present two sets of experiments to test model effectiveness and efficiency. On the first set of over 50 million search instances of 1.1 million distinct queries, BBM out-performs the state-of-the-art competitor by 29.2% in log-likelihood while being 57 times faster. On the second click-log set, spanning a quarter of petabyte data, we showcase the scalability of BBM: we implemented it on a commercial MapReduce cluster, and it took only 3 hours to compute the relevance for 1.15 billion distinct query-URL pairs.
The soft practice of the information systems practitioner: towards an engaging style for future graduate IS education
Authors: R. Naidoo
Venue: Proceedings of the 2009 Annual Conference of the Southern African Computer Lecturers' Association (2009)

This paper describes a more engaging style for future graduate education in IS. An opportunity to adapt the systems development project course, currently run for Honours students by the Department of Information Systems, at the University of Witwatersrand, emerged as a result of a growing recognition to emphasise the soft practice of the IS Practitioner. These changes were partly inspired by recent work conducted by leading management academic, Henry Mintzberg. Minztberg criticised management development approaches for overdeveloping a student's analytical ability while failing to address softer aspects. Although the blending of pedagogical approaches to address this critical gap is in its embryonic phase, including more authentic pedagogies is expected to increase the effectiveness of the students' preparedness for real-world challenges. In contrast to technological pedagogical advances which emphasises space rather than place, this paper promotes deeper social and experiential approaches. Increasing the student's understanding that the IS Practice is largely a social and facilitating activity is expected to significantly increase the future educative value of IS.
A New Distance Measure for Model-Based Sequence Clustering
Authors: Darío García-García, Emilio Parrado Hernández, Fernando Díaz-de María
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We review the existing alternatives for defining model-based distances for clustering sequences and propose a new one based on the Kullback-Leibler divergence. This distance is shown to be especially useful in combination with spectral clustering. For improved performance in real-world scenarios, a model selection scheme is also proposed.