ppxscal/embedding_network huggingface dataset:
Test-driven development in education: experiences with critical viewpoints
Authors: Sami Kollanus, Ville Isomöttönen
Venue: ACM SIGCSE Bulletin (2008)

Test-Driven Development (TDD) was applied in educational setting right after it became well-known as a key practice of Extreme Programming (XP). Basically, there are many studies reporting positive experiences on TDD applied in different levels of a curriculum. In this paper, we discuss the role of TDD in education through the students' experiences. In our experiment, a challenging programming task was applied in order to see what kind of difficulties the students would encounter and discuss. The students' answers revealed several topics that require a careful treatment in teaching to avoid conceptual confusion. For example, the topics include the scalability of TDD, extent of single test, and discipline.
Communal Network Architecture for Sharing High Bandwidth Services
Authors: Jorge Mamede, Rui Moreira, Bruno Oliveira, Vitor Brandão
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

This paper presents a network architecture for provisioning communal Internet access services to residential customers. The advantages of adopting the proposed architecture are enumerated both for Internet Service Providers (ISP) and residential clients. The paper presents also the CommGate, a gateway specially developed for managing the network traffic through multiple communal accesses. Tests were carried out simulating several community scenarios with different number of customers and generating different traffic loads. The results allow us to conclude about the performance of the CommGate and the benefits of the proposed architecture.
Center embossed diaphragm design guidelines and Fabry-Perot diaphragm fiber optic sensor
Authors: Yan Sun, Ganhua Feng, George Georgiou, Edip Niver, Karen Noe, Ken Chin
Venue: Microelectronics Journal (2008)

This research established the design guidelines for center embossed diaphragms for micro-diaphragm fiber type sensors. Following the guidelines, a center embossed diaphragm fiber optic sensor (CE-DFOS) based on Fabry-Perot interference was designed and fabricated with micro-electro-mechanical system (MEMS) technology. The CE-DFOS was experimentally verified to have the designed intrinsic frequency, and demonstrated high sensitivity in parallel testing with a piezoelectric (PZT) sensor.
The ASC-Alliance Projects: A Case Study of Large-Scale Parallel Scientific Code Development
Authors: Lorin Hochstein, Victor R. Basili
Venue: Computer (2008)

Computational scientists face many challenges when developing software that runs on large-scale parallel machines. However, software-engineering researchers haven't studied their software development processes in much detail. To better understand the nature of software development in this context, the authors examined five large-scale computational science software projects operated at the five ASC-Alliance centers.
Queuing Network Modeling of Transcription Typing
Authors: Changxu Wu, Yili Liu
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Transcription typing is one of the basic and common activities in human-machine interaction and 34 transcription typing phenomena have been discovered involving many aspects of human performance including interkey time, typing units and spans, typing errors, concurrent task performance, eye movements, and skill effects. Based on the queuing network theory of human performance [Liu 1996; 1997] and current discoveries in cognitive and neural science, this article extends and applies the Queuing Network-Model Human Processor (QN-MHP [Liu et al. 2006]) to model 32 transcription typing phenomena. The queuing network model of transcription typing offers new insights into the mechanisms of cognition and human-computer interaction. Its value in proactive ergonomics design of user interfaces is illustrated and discussed.
Memory management: tertiary buddy system
Authors: Divakar Yadav, A. K. Chaturvedi, Snehil Pansari, Avart Krishnan
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

An extension of the binary buddy method, called the tertiary buddy method for dynamic storage allocation is presented. Tertiary buddy method allows block sizes of 2k and 3.2k-3 where as the original binary buddy method allows only block sizes of 2k. This extension is achieved at an additional cost of two bits per block. Analysis of the internal fragmentation of the tertiary buddy system, binary buddy system, the Fibonacci buddy system and the weighted buddy system are given. Simulation results are presented which compare this method with other buddy methods.
Culturally adapted mobile phone interface design: correlation between categorization style and menu structure
Authors: Ji Hye Kim, Kun Pyo Lee
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

This paper presents the results of experiments conducted to understand the correlation between culturally different cognitive styles and issues of information architecture and flow, specifically in a mobile phone interface. 30 Korean participants and 30 Dutch participants participated in an on-screen prototype test as well as a cognitive style test. Different preferences were found for each cultural group regarding function/theme-related menus. In addition, individual categorization styles were found to be correlated to individual preferences. Overall, the findings indicated that performance and preferences in a certain menu structure are associated with cognitive styles, which may eventually help design culturally adapted interfaces. The correlation between prior experience and preference was not found to be significant in any of the tests.
Automated Management of Assets Based on RFID
Authors: Shengguang Meng, Dickson K. W. Chiu, Liu Wenyin, Xuxiang Chen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

With the maturing of the Radio Frequency Identification (RFID) technology, automated management of assets (particularly for mobile ones) in an enterprise using RFID becomes practical. This paper proposes a RFID-based Asset Management System (RAMS) and details how to maintain the whole life-cycle of assets from their acquisition, transfer, maintenance, audit taking, to retirement. The proposed system also displays spatial information of assets on an electronic geographical map using WebGIS technology. Further asset security is improved by automated notification of asset movement and malfunction alarm through SMS. Preliminary experiments show that the proposed system can improve the availability of assets and reduce the asset management cost dramatically.
Building a global location search service
Authors: Vibhuti Sengar, Tanuja Joshi, Joseph M. Joy, Samarth Prakash
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We present a crosslingual location search service that works across multiple countries and deals effectively with ambiguous and ill-formed queries. The system returns a ranked list of spatial regions (points, lines and polygons) that best match users' text queries, which can range from postal addresses to unstructured queries that list a few col-located map features. The system's robustness comes from a novel approach that exploits spatial coherence to identify viable interpretations of input text. Unlike existing state of the art geocoding systems, our system requires no region-specific rules, training or customization, and thus may be built to cover any region for which detailed map data is available, making it possible, for the first time, to rapidly build location search services for new regions, and more generally, approximate text search over arbitrary spatial repositories. Our system has been shown to outperform commercial geocoding systems, especially when spelling or format variations are introduced. We demonstrate our sys-tem's capabilities by showing results for a variety of text queries over a large dataset from several countries with widely differing address formats.
The chase revisited
Authors: Alin Deutsch, Alan Nash, Jeff Remmel
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in the negative) the open problem of decidability of termination of the standard chase, and we provide sufficient termination conditions which are strictly less over-conservative than the best previously known. We investigate the adequacy of the standard chase for checking query containment under constraints, constraint implication and computing certain answers in data exchange, gaining a deeper understanding by separating the algorithm from its result. We identify the properties of the chase result that are essential to the above applications, and we introduce the more general notion of F-universal model set, which supports query and constraint languages that are closed under a class F of mappings. By choosing F appropriately, we extend prior results to existential first-order queries and ∀∃-firstorder constraints. We show that the standard chase is incomplete for finding universal model sets, and we introduce the extended core chase which is complete, i.e. finds an F-universal model set when it exists. A key advantage of the new chase is that the same algorithm can be applied for all mapping classes F of interest, simply by modifying the set of constraints given as input. Even when restricted to the typical input in prior work, the new chase supports certain answer computation and containment/implication tests in strictly more cases than the incomplete standard chase.
Algorithms for additive clustering of rectangular data tables
Authors: Dirk Depril, Iven Van Mechelen, Boris Mirkin
Venue: Computational Statistics Data Analysis (2008)

The overlapping additive clustering model or principal cluster model is a model for two-way two-mode object by variable data that implies an overlapping clustering of the objects and a set of profiles (characteristic variable values for each cluster). The model values of the variables of an object are the sum of the profiles of its corresponding clusters. In the associated data analysis the data matrix at hand is approximated by an overlapping additive clustering model of a prespecified rank by minimizing a least squares loss function. Recently an algorithm has been proposed for this purpose. This algorithm is a sequential fitting strategy, also called the method of principal clusters (PCL). Theoretical and empirical evidence that the PCL algorithm may have problems in revealing the true structure underlying a data set will be presented. As a way out, three new algorithms to fit the principal cluster model to empirical data will be presented: two of an alternating least squares (ALS) type, orthogonally combined with two different starting strategies, and one based on simulated annealing (SA). In a simulation study it is demonstrated that all three new algorithms outperform the existing PCL algorithm. The amount of objects that belong to more than one cluster (the overlap) is further found to have a considerable influence on the algorithmic performance of the ALS algorithms, with low amounts of overlap requiring a different starting strategy than high ones. As a consequence, for the analysis of real data sets in practice, a hybrid approach will be presented consisting of one of the ALS algorithms initialized by means of the two starting strategies under study.
Technical communique: Disturbance attenuation by dynamic output feedback for input-delay systems
Authors: Michael Di Loreto, Jean Jacques Loiseau, Jean-François Lafay
Venue: Automatica (Journal of IFAC) (2008)

This paper addresses the optimal disturbance attenuation problem by output feedback for multivariable linear systems with delayed inputs. The attenuation is optimal in the sense that the controller minimizes the maximal amplitude of the plant output in response to such a disturbance. The controller is a general feedback, involving an observer, a state predictor, and a predicted state feedback. The optimal disturbance attenuation problem is formulated in terms of an equivalent system without delay. The optimal bound of the disturbance attenuation is then characterized, and it is shown that the optimal controller tends to have high gains. A necessary and sufficient condition to guarantee the existence of an optimal solution is provided using the geometric approach.
Utilising Abstract Matching to Preserve the Nature of Heuristics in Design Optimisation
Authors: Cameron Maxwell, John Leaney, Tim O'Neill
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Design space exploration, the generation of alternate designs to identify working designs with varying system properties, has the potential to provide a basis for the optimisation of computer-based system architectures. To utilise design space exploration for this purpose requires that an effective mechanism exist for the storage and application of potential design changes. Heuristics have shown some promise in this area due to their ability to capture expert design knowledge and their flexibility across multiple domains. Heuristics are also especially attractive as change descriptions as they can capture changes that operate across a large spectrum of change detail, from the very detailed to the very abstract. Heuristics are, however, at their most powerful, and their most useful, when they are specified in an abstract manner. This presents a challenge in the formal application of heuristics in capturing design knowledge. Formally describing heuristics inclines their specification of change to be in a more detailed, more concrete, state than an abstract one. This occurs because architectural models tend be both domain specific and are often described at a more concrete level than the level at which the heuristic is described. This has the potential to greatly reduce the effectiveness of heuristics. In this paper we propose that by providing an abstract match method heuristics may be specified in an abstract manner and still be applied to a detailed formal model, thereby eliminating this problem.
Influences of CAI English Teaching Pattern on the Autonomous Learning -Research on Divided Class Instruction of Independent College
Authors: Xianzhi Tian
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

With the development of the technology of CAI, it is widely used in our English teaching. So many people focus their attentions on the influences of CAI in different aspects. Therefore, the author tries to investigate the influences of CAI English teaching pattern on the Autonomous Learning. in divided class instruction of independent college. As far as it is concerned, it is important for us to find out the essential influences of" divided class instruction" on students in independent college, thus to make the reform of our teaching pattern successfully.
Implementation of a Generic Autonomic Framework
Authors: Radu Calinescu
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Based on insights from the implementation of commercial products for data-centre resource management, we identified key challenges in the development of cost-effective autonomic solutions, and best practices for overcoming these challenges. In a related paper, we proposed a generic autonomic framework that complies with these best practices, and suggested ways in which existing technologies could be used to realise this framework. In this paper, we describe the actual implementation of our autonomic framework as a service-oriented architecture, and we show how the universal policy engine at its core can be configured to manage the allocation of server capacity to services of different priorities. This case study demonstrates the effectiveness of our generic approach to autonomic solution development in an area of great interest for commercial data centres, research laboratories and application service providers.
Modelling higher-order dual nondeterminacy
Authors: Joseph M. Morris, Malcolm Tyrrell
Venue: Acta Informatica (2008)

We investigate models for programming and specifying in which higher-order functions and nondeterminacy (both demonic and angelic) coexist. The models are built using predicate transformers, binary multirelations, state transformers, and free lattices over a poset. We show there exist suitable models in each approach, and that they are isomorphic. The models support an algebra of nondeterminacy which we use to prove that the classical list fusion law holds even in the presence of nondeterminacy.
Generalized Eckstein-Bertsekas proximal point algorithm based on A-maximal monotonicity design
Authors: Rom U. Verma
Venue: Computers Mathematics with Applications (2008)

A general design for the Eckstein-Bertsekas proximal point algorithm, using the notion of the A-maximal monotonicity, is developed. Convergence analysis for the generalized Eckstein-Bertsekas proximal point algorithm in the context of solving a class of nonlinear inclusion problems is explored. Some auxiliary results of interest involving A-maximal monotone mappings are also included. The obtained results generalize investigations on general maximal monotonicity and beyond.
Personal data protection law: The Malaysian experience
Authors: Ida Madieha Azmi
Venue: Information and Communications Technology Law (2007)

In 1998, the Malaysian government introduced a draft Data Protection Bill. This Bill has never made it to Parliament due to heavy opposition from the communication and multimedia industry. In a surprise move, the government abandoned the European Union approach for a more 'industry friendly' set of regulations. The exact nature of the proposed draft bill is yet to be seen as, unlike its predecessor, the whole process of drafting is being kept confidential. This article discusses the Malaysian initiative in introducing specific data protection laws in the years following the archived draft Personal Data Protection Bill. It is the hypothesis of this article that the lack of protection for data privacy stems largely from the widespread lack of recognition of the right of privacy in general. With regards to data protection, for example, some view the current sectoral approach to data protection is adequate in providing the minimum security needed in the industry. Others, however, view the sectoral approach as rather piecemeal and hardly sufficient to provide the required security. As to the general rights of privacy, the non-recognition of a general right of privacy is hardly surprising. In a country where individual freedom of expression is effectively not guaranteed, the European-style notion that an individual should be free from unnecessary intrusion and snooping from the state is a luxury. In a country that professes to adhere to Islamic teaching as its major religion, this proposition is entirely not acceptable. Leaving religious concerns aside, the truth is that many in the industry feel that having a stringent data protection law would be detrimental to the overall industry's needs and interests. Furthermore, other laws relevant to data privacy exist, and they provide the minimum security required by the industry without unduly inhibiting its growth.
Adoption of ICT in a government organization in a developing country: An empirical study
Authors: Babita Gupta, Subhasish Dasgupta, Atul Gupta
Venue: The Journal of Strategic Information Systems (2008)

eGovernment initiatives all over the world endeavor to integrate Information and Communication Technologies (ICT) to transform delivery of government services to their stakeholders by improving quality of services, accountability and efficiency. In this study we explore adoption of ICT to enhance government-to-employee interactions in a government organization in a developing country. We examine this adoption behavior by utilizing the Unified Theory of Acceptance and Use of Technology (UTAUT) that provides an integrative view of user acceptance. We found that performance and effort expectancy, social influence and facilitating conditions all positively impact the use of the ICT. We did not find a significant moderating effect of gender on these relationships.
Genetically programmed-based artificial features extraction applied to fault detection
Authors: Hiram Firpi, George Vachtsevanos
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper presents a novel application of genetically programmed artificial features, which are computer crafted, data driven, and possibly without physical interpretation, to the problem of fault detection. Artificial features are extracted from vibration data of an accelerometer sensor to monitor and detect a crack fault or incipient failure seeded in an intermediate gearbox of a helicopter's main transmission. Classification accuracies for the artificial feature constructed from raw data exceeded 99% over training and independent validation sets. As a benchmark, GP-based artificial features constructed from conventional ones underperformed those derived from raw data by over 2% over the training and over 11% over the testing data.
Markov paging
Authors: A. R. Karlin
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. The authors use this model to study the fault-rate of paging algorithms, a quantity of interest to practitioners. They first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain. They address the problem of efficiently devising a paging strategy with low fault-rate for a given Markov chain. They show that a number of intuitively good approaches fail. Their main result is an efficient procedure that, on any Markov chain, will give a paging algorithm with fault-rate at most a constant times optimal. Their techniques also show that some algorithms that do poorly in practice fail in the Markov setting, despite known (good) performance guarantees when the requests are generated independently from a probability distribution.
Building test steps for SOA service orchestration in web service testing tools
Authors: Hoijin Yoon, EunMi Ji, Byoungju Choi
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Many SOA developers still stay in the tools supporting Web services. In terms of testing, they rely on some popular open source products, such as SoapUI, JUnit, and TESTMAKER, which were developed for testing Web services. The tools could work well also on SOA, if they test an orchestration of services involved in connections between Business Services and Application Services. This paper first analyzes what the connection is in SOA, and then it proposes what should be included in their test steps to test the connections according to the definition of the connection of services with supporting SOA principles. For the developers who still use the Web service testing tools, this paper contributes on providing the test step supporting the SOA connection testing, which is analyzed to be one of the most important factors for successful SOA products.