ppxscal/embedding_network huggingface dataset:
A study of the relationship between institutional policy, organisational culture and e-learning use in four South African universities
Authors: Laura Czerniewicz, Cheryl Brown
Venue: Computers Education (2009)

This article investigates the relationship between policy (conceptualised as goals, values and resources), organisational culture and e-learning use. Through both qualitative and quantitative research methods, we gathered data about staff and student perspectives from four diverse South African universities representing a selection of ICT in education policy types (Structured and Unstructured) and organisational cultural types of ''collegium, bureaucracy, corporate and enterprise'' (McNay, 1995). While our findings show a clear relationship between policy and use of ICTs for teaching and learning, organisational culture is found crucial to policy mediation and the way that e-learning use is embedded within the organisation. We conclude that although a Structured Corporate institutional type enables the attainment of a ''critical mass'' within e-learning, Unstructured Collegium institutions are better at fostering innovation. Unstructured Bureaucratic institutions are the least enabling of either top down or bottom up e-learning change.
An Interest Rate Adjusting Method with Bayesian Estimation in Social Lending
Authors: Masashi Iwakami, Takayuki Ito
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

In social lending, in which an individual lends or borrows money using an SNS network, a person who lends money must take a risk that the money won't be returned. Since social lending is a comparatively new field, very few studies have been made. Therefore, we present an experimental assessment of the influence of the updating of an interest rate using Bayesian estimation, which takes into consideration the influence of groups with agents. Our method decreases dispersions of the delay of the borrower in payment with the increasing loan history of the borrower. As a result, when the lenders are risk-averse (risk means the dispersions of the delay of the borrower at each interest rate), the number of transactions increases. Therefore, our method is effective because it can cause the transactions of lenders who are risk-averse to increase.
NTHU-Route 2.0: a fast and stable global router
Authors: Yen-Jung Chang, Yu-Ting Lee, Ting-Chi Wang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We present in this paper a fast and stable global router called NTHU-Route 2.0 that improves the solution quality and runtime of a state-of-the-art router, NTHU-Route, by the following enhancements: (1) a new history based cost function, (2) new ordering methods for congested region identification and rip-up and reroute, and (3) two implementation techniques. The experimental results show that NTHU-Router 2.0 solves all ISPD98 benchmarks with very good quality. Moreover, it routes 7 of 8 ISPD07 benchmarks without any overflow. In particular, for one of the ISPD07 benchmarks which are thought to be difficult cases previously, NTHU-Route 2.0 can completely eliminate its total overflow. NTHU-Route 2.0 also successfully solves 12 of 16 ISPD08 benchmarks without causing any overflow.
Designing for other people's strengths and motivations: Three cases using context, visions, and experiential prototypes
Authors: P. J. Stappers, H. van Rijn, S. C. Kistemaker, A. E. Hennink, F. Sleeswijk Visser
Venue: Advanced Engineering Informatics (2009)

The front end of product development has seen a rapid growth in attention for the end-users. For radical innovation, as well as for redesign and optimization, design teams are looking to incorporate the experiential knowledge of users into the design solutions. By means of three cases, we describe participatory techniques in the early phases of design, and how they impact both the content and the methods of designing. Key elements in this are found in the establishing of needs, requirements, design visions, and early experience prototyping. But these different steps are no longer clearly separated, as iterative prototyping with user participation throughout the design process is becoming a more regular approach to designing.
A coupled arbitrary Lagrangian-Eulerian and Lagrangian method for computation of free surface flows with insoluble surfactants
Authors: Sashikumaar Ganesan, Lutz Tobiska
Venue: Journal of Computational Physics (2009)

A finite element scheme to compute the dynamics of insoluble surfactant on a deforming free surface is presented. The free surface is tracked by the arbitrary Lagrangian-Eulerian (ALE) approach, whereas the surfactant concentration transport equation is approximated in a Lagrangian manner. Since boundary resolved moving meshes are used in the ALE approach, the surface tension, which may be a linear or nonlinear function of surfactant concentration (equation of state), and the Marangoni forces can be incorporated directly into the numerical scheme. Further, the Laplace-Beltrami operator technique, which reduces one order of differentiation associated with the curvature, is used to handle the curvature approximation. A number of 3D-axisymmetric computations are performed to validate the proposed numerical scheme. An excellent surfactant mass conservation without any additional mass correction scheme is obtained. The differences in using a linear and a nonlinear equation of state, respectively, on the flow dynamics of a freely oscillating droplet are demonstrated.
Preemptive Online Scheduling: Optimal Algorithms for&#x00a0;All&#x00a0;Speeds
Authors: Tom&#x00e1;&#x0161; Ebenlendr, Wojciech Jawor, Ji&#x0159;&#x00ed; Sgall
Venue: Algorithmica (2009)

Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e&#x2248;2.718. We also give a complete analysis of the competitive ratio for three machines.
Multiple carets, multiple screens and multi-tasking: new behaviours with multiple computers
Authors: Russell Beale, William Edmondson
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

This study presents interview based case studies of users who work with multiple computers as well as multiple displays. Such users have not been studied before. The behaviour is discussed in terms of both technical and cognitive dimensions, and we identify the importance of having multiple carets and the complexity of multi-tasking and how it can be supported across multiple machines in a way not possible on a single system.
Restoration of the RET Phase Function Using Deconvolution
Authors: Huajian Cui, Jürgen Richter, Miqdad Al-Nuaimi, Rafael Caldeirinha
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The influence of vegetation has become an important aspect of the design of wireless communication links. In recent years theory of Radiative Energy Transfer (RET) has been adapted as a reliable tool to predict the radiowave propagation through and near vegetation. The developed RET prediction model requires 4 input independent parameters, which so far had to be established from one measurement only, thus limiting their accuracy. An independent measurement which is termed the phase function can readily yield 2 of the 4 input parameters independently, which significantly increases the accuracy of these parameters. However one major factor influencing the phase function measurement is the radiation pattern of the receiving antenna. The measured curve will be the result of the convolution of the antenna radiation pattern and the phase function of the vegetation medium. The measurement curve therefore needs to undergo a deconvolution process before any RET input parameters can be derived from it. This paper presents the deconvolution method developed using optimal compensation deconvolution methods. Deconvolution is demonstrated using both simulation signal shapes and those measured in vegetation set up in the anechoic chamber. This paper discusses different cases of optimal compensation filtering with the relative curves shown.
3D Audio Perception System for Humanoid Robots
Authors: Norbert Schmitz, Carsten Spranger, Karsten Berns
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

An audio system is one of the basic components of a humanoid robot designed for natural interaction.For many interaction purposes it is sufficient to use the sound detection and localization as attention system for the vision system.In this paper the audio perception module of the robot ROMAN is presented including the integration into the existing control structure and the localization algorithm using a microphone array with 6 microphones.The reduction of data into so called sector maps is presented and the interaction with the control architecture is shown.
A low cost common educational framework
Authors: Charles H. Pickman, Dar-Biau Liu
Venue: Journal of Computing Sciences in Colleges (2009)

Many institutions of higher learning have curricula which can be designed and implemented at minimal cost and effort based upon a proposed common educational framework. A common educational framework is a low cost and flexible software suite of integrated open source applications which can be rapidly modified to support specific coursework. Teachers can choose to develop some of their coursework within their department based on a common educational framework; which enables exploration, learning and goal setting among adjacent disciplines and departments. Teachers can develop a structured and tailored educational plan over a multi-semester course of study. Teams of students within each course can independently work on their projects, resulting in a realistic learning environment enhanced by interdepartmental and interdisciplinary interaction. A common educational framework enables increased faculty interaction and development within departments and between departments. A proposed low cost open source common educational framework is discussed and evaluated.
Sensory Mapping Algorithm and Enhanced Product Development
Authors: Udi E. Makov, M. Ben-Assor, I. Sam Saguy
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This article describes a Sensory Mapping Algorithm based on the simultaneous application of data mining on two sets of data, corresponding to two processes governing customers' preferences: The sensory process, which governs the acceptance of a product as a function of hedonic variables, and the analytical process, which relate the sensory responses to objective analytical properties of the product; Data mining is carried out by the means of Structural Equation Modeling, and the final algorithm allows the prediction of purchase intent of a new product given its sensory attributes and analytical composition.
Time and Fairness in a Process Algebra with Non-blocking Reading
Authors: Flavio Corradini, Maria Rita Berardini, Walter Vogler
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairness, liveness and the timing of systems, using as application Dekker's mutual exclusion algorithm we already considered in [4]. Regarding some actions as reading, this algorithm satisfies MUTEX liveness already under the assumption of fairness of actions. We demonstrate an interesting correspondence between liveness and the catastrophic cycles that we introduced in [6] when studying the performance of pipelining. Finally, our previous result on the correspondence between timing and fairness [4] scales up to the extended language.
Autonomic Computing Now You See It, Now You Don't
Authors: Hausi A. Müller, Holger M. Kienle, Ulrike Stege
Venue: Software Engineering: International Summer Schools, ISSSE 2006-2008, Salerno, Italy, Revised Tutorial Lectures (2009)

With the rapid growth of web services and socio-technical ecosystems, the management complexity of these modern, decentralized, distributed computing systems presents significant challenges for businesses and often exceeds the capabilities of human operators. Autonomic computing is an effective set of technologies, models, architecture patterns, standards, and processes to cope with and reign in the management complexity of dynamic computing systems using feedback control, adaptation, and self-management. At the core of an autonomic system are control loops which sense their environment, model their behavior in that environment, and take action to change the environment or their own behavior. Computer science researchers often approach the design of such highly dynamical systems from a software architecture perspective whereas engineering researchers start with a feedback control perspective. In this article, we argue that both design perspectives are needed and necessary for autonomic system design.
Oil Refining Enterprise Performance Evaluation Based on DEA and SVM
Authors: Jiekun Song, Zaixu Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Enterprise performance evaluation is an important means of enterprise management, which can diagnose the whole development status of enterprise. Data envelopment analysis (DEA) is one of the most frequently used evaluation methods and support vector machine (SVM) is a novel method of data mining, which can be used for prediction and regression. Based on DEA and SVM, the paper proposes a method for evaluating and predicting enterprise performance. First, DEA method is used to evaluate DEA efficiency of all the oil refining enterprises performance. Then the input/output data and results of some decision making units (DMUs) are selected as the learning examples to train the SVM network and the others are used as the test examples to test the network. If the SVM network is testified well, a synthetic evaluation formula can be given to predict the DEA efficiency of a new DMU. A real example testifies the efficiency, practicability and intellectual ability of this method.
A pair of threshold determination method for the dynamic filtering in wireless sensor networks based on fuzzy logic
Authors: Sang Jin Lee, Man Ho Han, Tae Ho Cho
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Sensor networks can be easily compromised by an adversary because of hostile environments. An adversary may use compromised nodes to inject false reports into the network. The dynamic en-route scheme to filter false data injection can detect and drop such false reports during the forwarding phase. In this scheme, determining between a threshold value and the period for dissemination are important, as it trades off between security power and energy consumption. Thus, we should choose a threshold value and the period for authentication key dissemination such that it provides sufficient resilience, yet is small enough to conserve energy. This paper presents determining a pair of threshold method using fuzzy logic for the dynamic en-route scheme to filter false reports in wireless sensor networks. Our proposed method can determine threshold value which is the number of message authentication code and when to disseminate new authentication keys using a fuzzy logic. We will demonstrate resilience and energy efficiency of the proposed method through the simulation result.
Nanorobot for Brain Aneurysm
Authors: Adriano Cavalcanti, Bijan Shirinzadeh, Toshio Fukuda, Seiichi Ikeda
Venue: International Journal of Robotics Research (2009)

In this paper we present how nanoelectronics should advance medicine, providing details on the teleoperated techniques and equipment design methodology necessary for the effective development of nanorobots. The platform architecture describes how to use a nanorobot for intracranial prognosis, and shows how it should be integrated for medical instrumentation. Furthermore, the current study establishes proteomics, nanobioelectronics, and electromagnetics as the basis to advance medical nanorobotics. To illustrate the proposed approach, the nanorobots must search for protein overexpression signals in order to recognize initial stages of aneurysm. An advanced nanomechatromics simulator, using a three-dimensional task-based environment, is implemented to provide an effective tool for device prototyping and medical instrumentation analysis. Thus, based on clinical data and nanobioelectronics, the proposed model offers details about how a nanorobot should help with the early detection of cerebral aneurysm.
Overlay aware interconnect and timing variation modeling for double patterning technology
Authors: Jae-Seok Yang, David Z. Pan
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

As Double Patterning Technology (DPT) becomes the only solution for 32-nm lithography process, we need to investigate how DPT affects the performance of a chip. In this paper, we present an efficient modeling of timing variation with overlay which is inevitable for DPT. Our work makes it possible to analyze timing with overlay variables. Since the variation of metal space caused by overlay results in coupling capacitance variation, we first model metal spacing variation with individual overlay sources. Then, all overlay sources are considered to determine the worst timing with coupling capacitance variation. Non-parallel pattern caused by overlay is converted to parallel one with equivalent spacing having the same delay to be applicable of a traditional RC extraction flow. To verify our work, we use identical interconnects having different positions and different layout decompositions. Experimental result shows that the delay has a variation from 7.8% to 9.1% depending on their locations. The well decomposed structure shows only 2.7% delay variation.
Load-balancing on swapped or OTIS networks
Authors: Chenggui Zhao, Wenjun Xiao, Behrooz Parhami
Venue: Journal of Parallel and Distributed Computing (2009)

Existing local iterative algorithms for load-balancing are ill-suited to many large-scale interconnection networks. The main reasons are complicated Laplace spectrum computations and flow scheduling strategies. Many large-scale networks are modular and/or hierarchically structured, a prime example being the class of swapped or OTIS networks that have received much attention in recent years. We propose a new local scheme, called DED-X, for load-balancing on homogeneous and heterogeneous swapped/OTIS networks. Our scheme needs spectral information only for the much smaller basis or factor graph, which is of size O(n) rather than O(n^2), and it schedules load flow on intragroup and intergroup links separately. We justify the improvements offered by DED-X schemes over traditional X schemes analytically and verify the advantages of our approach, in terms of efficiency and stability, via simulation.
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
Authors: Valerio Senni, Alberto Pettorossi, Maurizio Proietti
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The existential variables of a clause in a constraint logic program are the variables which occur in the body of the clause and not in its head. The elimination of these variables is a transformation technique which is often used for improving program efficiency and verifying program properties. We consider a folding transformation rule which ensures the elimination of existential variables and we propose an algorithm for applying this rule in the case where the constraints are linear inequations over rational or real numbers. The algorithm combines techniques for matching terms modulo equational theories and techniques for solving systems of linear inequations. We show that an implementation of our folding algorithm performs well in practice.
Cast Shadow Removal Using Time and Exposure Varying Images
Authors: Pankaj Rajan, Wei Yan
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Shadows are the natural accomplice of objects. As such, they have affected various algorithms dealing with image segmentation, object tracking and recognition. A lot of research has been focused on removing shadows from images while preserving the information available in the shadow region. In this paper, we present a simple yet robust algorithm for cast shadow removal utilizing images taken at different times with different exposures. While different exposures allow good recovery of shadow regions, the time-varying feature is used to suppress the shadow edges.
Efficient Discovery of Statistically Significant Association Rules
Authors: Wilhelmiina Hämäläinen, Matti Nykänen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Searching statistically significant association rules is an important but neglected problem. Traditional association rules do not capture the idea of statistical dependence and the resulting rules can be spurious, while the most significant rules may be missing. This leads to erroneous models and predictions which often become expensive.The problem is computationally very difficult, because the significance is not a monotonic property. However, in this paper we prove several other properties, which can be used for pruning the search space. The properties are implemented in the StatApriori algorithm, which searches statistically significant, non-redundant association rules. Based on both theoretical and empirical observations, the resulting rules are very accurate compared to traditional association rules. In addition, StatApriori can work with extremely low frequencies, thus finding new interesting rules.
A New Method of Self-Calibration for Surface Wave Radar Antenna
Authors: Zhong Zhifeng, Huang Jian
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Making full use of phase of separate channel and different echo information, array self-calibration of high-resolution was realized with the method of resolving equations for the nonlinear array of surface wave radar in this paper. The algorithm reduces computational quantity because which does not need to search optimal results, so it can be used for real-time tracking system. On the end of this paper, in spite of low SNR echoes and short data series for analyzing, experiments show the validity of this method and the applicability for practical projects.