ppxscal/embedding_network huggingface dataset:
Collaborative e-learning as a driving force towards standardisation and higher university standards
Authors: Bodil Ask, Harald Haugen
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The Bologna process and its subsequent communiqués are central in the European drives for internationalisation, collaboration and exchanges between higher educational institutions. Mutual understanding of level, credits and grades are crucial, and some key standards are now emerging through joint projects. A framework of standards has been introduced. Not all academics, however, do yet fully understand or adhere to the systems that their Ministers have subscribed to. The standards are nevertheless important steps towards the European Higher Education Area, EHEA. Acceptance of a Quality Assurance System is central issue. Several attempts are made to create a basis for joint degrees and study programmes, and for the exchange of courses, but level of quality is hard to agree on. Principles and models from European projects have now been adopted and modified to suit the needs of the Global Virtual University, a branch of the United Nations University. This may imply that European standards can be accepted world wide.
CADAC: A Controlled-Precision Decimal Arithmetic Unit
Authors: M. S. Cohen
Venue: IEEE Transactions on Computers (1983)

This paper describes the design of an arithmetic unit called CADAC (clean arithmetic with decimal base and controlled precision). Programming language specifications for carrying out "ideal" floating-point arithmetic are described first. These specifications include detailed requirements for dynamic precision control and exception handling, along with both complex and interval arithmetic at the level of a programming language such as Fortran or PL/I.
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
Authors: Demetres Christofides, Klas Markström
Venue: Random Structures Algorithms (2008)

The AlonRoichman theorem states that for every &epsilon;> 0 there is a constant c(&epsilon;), such that the Cayley graph of a finite group G with respect to c(&epsilon;)log |G| elements of G, chosen independently and uniformly at random, has expected second largest eigenvalue less than &epsilon;. In particular, such a graph is an expander with high probability. Landau and Russell, and independently Loh and Schulman, improved the bounds of the theorem. Following Landau and Russell we give a new proof of the result, improving the bounds even further. When considered for a general group G, our bounds are in a sense best possible. We also give a generalization of the AlonRoichman theorem to random coset graphs. Our proof uses a Hoeffding-type result for operator valued random variables, which we believe can be of independent interest. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
A Complexity Measure
Authors: T. J. McCabe
Venue: IEEE Transactions on Software Engineering (1976)

This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.
Adaptive Window Based Uneven Lighting Document Segmentation
Authors: G. Gu, W. Han
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

The method presented in this paper has two noteworthy aspects. First, in order to improve segmentation quality, sub-pixel interpolation using quadratic curve fitting is performed. Second, adaptive widow for thresholding is done in a novel way. The variance of gray value in each widow is used both for widow size choosing and grayscale thresholding. Experiment results show that this segmentation algorithm is suitable for treating document images of uneven lighting.
Improvement of learning algorithms for RBF neural networks in a helicopter sound identification system
Authors: Gh. A. Montazer, Reza Sabzevari, H. Gh. Khatir
Venue: Neurocomputing (2007)

This paper presents a set of optimizations in learning algorithms commonly used for training radial basis function (RBF) neural networks. These optimizations are applied to a RBF neural network used in identifying helicopter types, processing their rotor sounds. The first method uses an optimum learning rate in each iteration of training process. This method increases the speed of learning process and also achieves an absolute stability in network response. Another modification is applied to quick propagation (QP) method as a generalization that attains more learning speed. Finally, we introduced the general optimum steepest descent (GOSD) method, which contains both improvements in learning RBF networks. All modified methods are employed in training a system that recognizes helicopters' rotor sounds exploiting a RBF neural network. Comparing results of these learning methods with the previous ones yields interesting outcomes.
Provenance for Visualizations: Reproducibility and Beyond
Authors: Claudio T. Silva, Juliana Freire, Steven P. Callahan
Venue: Computing in Science and Engineering (2007)

The demand for the construction of complex visualizations is growing in many disciplines of science, as users are faced with ever increasing volumes of data to analyze. The authors present VisTrails, an open source provenance-management system that provides infrastructure for data exploration and visualization.
On Memory Usage Under Microprogramming
Authors: G. W. R. Luderer
Venue: Computer (1972)

The issue of quantitative determination of memory usage and utilization is central to multiprogramming computer systems. In such systems, one tries to improve the system performance by loading a set of independent jobs together into main memory. If the jobs have complementary resource requirements and the system is capable of parallel resource operation, the total time required to complete all jobs is less than if they were processed serially, i.e., in a uniprogramming mode. The situation is illustrated in Figure 1 showing a space-time diagram of memory occupancy, where the available memory space is dynamically covered with jobs. The term "job" is used in the sense of "process" as defined in [1], which also gives an excellent survey of related subjects. However, we restrict jobs to keep a fixed amount of memory until they are completed. Generalization of the concepts to be developed to include systems with dynamic allocation, swapping, paging is possible but not attempted here.
MultiFunction Threshold Gates
Authors: D. Hampel
Venue: IEEE Transactions on Computers (1973)

Threshold logic gates, up to now, generally have been presumed to provide a single function of the input variables. The threshold gates that have been integrated [1]-4] were naturally double-sided and provided complementary outputs or, more specifically, complemented dual outputs. This paper shows that the inphase and out-of-phase outputs can, in fact, be designed to provide grossly different functions of the input variables. Two examples of this technique have already been shown [5] and one of these, the full adder, has been demonstrated in a multiplier [6]. Now this technique is generalized, and furthermore, it is shown how each side can be subdivided to provide a number of functions simultaneously. Finally, virtual oRing of specific output points from each side will result in still more functions. The sum-resistor specification for any order function on either side is given. Practical application of these techniques are discussed, including those basic ones that have already been disclosed.
A Convexity-Preserving Grid Refinement Algorithm for Interpolation of Bivariate Functions
Authors: John Roulier
Venue: IEEE Computer Graphics and Applications (1987)

This article presents an algorithms to refine bevariate grid data that is convex (and monotonic) along the grid lines so that the refined data exhibits the same convexity (and monotonicity). The algorithm is based on some observations about univariate data and an algorithm for shape-preserving quadratic splines for such data. It can be used as is or with standard surface-path techniques.
Toggle Equivalence Preserving (TEP) Logic Optimization
Authors: Eugene Goldberg, Kanupriya Gulati, Sunil Khatri
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

We describe a procedure (called the TEP procedure) that, given a multi-output circuit M, builds another multi-output circuit M* that is toggle equivalent to M. The TEP procedure can be used in the following two scenarios. First, since for singleoutput circuits toggle equivalence means functional equivalence, the TEP procedure can be used in "regular" logic synthesis. Second, the TEP procedure enables a powerful synthesis method called LS_TE (Logic Synthesis preserving Toggle Equivalence). Given a circuit N and its partitioning into subcircuits Ni , LS_TE builds an optimized circuit N* by replacing subcircuits Ni with their toggle equivalent counterparts N* i . The replacement of Ni with N* i is done by the TEP procedure. We give results of optimizing single-output circuits by the TEP procedure and some preliminary results of using the TEP procedure in LS_TE. These results show the promise of the TEP procedure and LS_TE.
Notes from Left Field: Corporate Slide Presentations
Authors: Joan Wright
Venue: IEEE Computer Graphics and Applications (1983)

An informal look into the way one company uses a slide-making system shows that machines are nice, but nothing is more important than planning. 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
Automatic Test Generation for Dynamic Data Structures
Authors: Ruilian Zhao, Qing Li
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Nowadays, many test data generation approaches are employed on basic numerical types such as integer and real data. However, in real practice, pointers and dynamic data structures are so widely used that most recent test data generation approaches are restricted in application. This paper proposes a path-oriented test data generation approach specifically for dynamic pointer data. Firstly, a least restrictive shape involved in input structure is created, which meets pointer constraints for a given path. Secondly, the value of data field in the created shape is determined. The experiment results show that our approach is effective and practicable in test generation for dynamic pointer data.
A Suffix Tree Based Handwritten Chinese Address Recognition System
Authors: Y. Jiang, X. Ding, Z. Ren
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

The main contribution of the paper is that it presents a suffix tree based data structure for automatic handwritten Chinese address reading. Since lots of papers have dis- cussed the destination address block (DAB) location for Chinese, we will not extend it in this paper. Instead, we pay more attention to improve the address matching per- formance after DAB location. As some conventional meth- ods, the extracted text lines are pre-segmented into a se- ries of radicals. We then build a hierarchical structure of sub-strings from the recognized characters of valid radical combinations. Coarse address candidates are selected at the same time. In address maching, we incorporate post- code information to filter redundant addresses. The pre- segmented radicals are compared with candidate address and a cost function combining recognition and structrual cost is evaluated for final decision. In the system, character segmentation, recognition, string searching and matching are considered synchronously by taking advantage of lex- icon knowledge. Suffix tree can greatly facilitate the sub- string generation process and enable the matching process to start from any character to collect potentially bitty in- formation. Therefore, our algorithms is more robust to the intervening noises and irregular writing styles. Finallly, we test 1,000 handwritten Chinese envelopes and achieve a correct rate of 85.30% in 3.0 seconds per mail averagely.
Nanoimprint in PDMS on glass with two-level hybrid stamp
Authors: Patrick Carlberg, Lars Montelius, Jonas Tegenfeldt
Venue: Microelectronic Engineering (2008)

In this article we examine the use of two-level hybrid-material stamps and nanoimprint lithography (NIL) of poly(dimethylsiloxane) (PDMS) on glass substrates. A silicon/SU8 stamp manufacturing process has been developed, in order to combine nanometer and micrometer structures, thus avoiding complex deep etching processes. The stamp has been test printed in polymethyl methacrylate (PMMA) to demonstrate functionality. We describe polymer flow problems for imprinting large structures and identify optimized parameters, in accordance with previously published findings. The use of PDMS as imprint polymer was examined. Imprinting works well, however, large recovery after separation shrinks the micrometer channels substantially and renders the nanochannels useless. Glass substrates in combination with silicon stamps were used, evaluated and showed to work well at low temperature.
Dominance-based rough set approach and knowledge reductions in incomplete ordered information system
Authors: Xibei Yang, Jingyu Yang, Chen Wu, Dongjun Yu
Venue: Information Sciences: an International Journal (2008)

Many methods based on the rough set to deal with incomplete information systems have been proposed in recent years. However, they are only suitable for the incomplete systems with regular attributes whose domains are not preference-ordered. This paper thus attempts to present research focusing on a complex incomplete information system-the incomplete ordered information system. In such incomplete information systems, all attributes are considered as criterions. A criterion indicates an attribute with preference-ordered domain. To conduct classification analysis in the incomplete ordered information system, the concept of similarity dominance relation is first proposed. Two types of knowledge reductions are then formed for preserving two different notions of similarity dominance relations. With introduction of the approximate distribution reduct into the incomplete ordered decision system, the judgment theorems and discernibility matrixes associated with four novel approximate distribution reducts are obtained. A numerical example is employed to substantiate the conceptual arguments.
Heuristic Algorithms for the Dynamic Taxipooling Problem Based on Intelligent Transportation System Technologies
Authors: Chi-Chung Tao, Chun-Ying Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The convergence of the Intelligent Transportation System (ITS) technologies has given rise to new opportunities for creative and incentive taxi services such as taxipooling. Taxipooling is similar to carpooling which is based on the idea that sets of users having the same travel destination and sharing vehicles. This paper presents two heuristic algorithms based on greedy method and the time-space network for the case of one origin to many destinations ("one- to-many") and many origins to one destination ("many-to-one"). These algorithms are used to support a field trial at Taipei Nei-Hu Science and Technology Park in Taiwan. The results of numerical tests have demonstrated that the outcomes of these heuristic algorithms are fairly plausible.
Approximation Reduction Based on Similarity Relation
Authors: Bing Huang, Ling Guo, Xian-zhong Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Knowledge reduction is one of the most important tasks in rough set theory, and most types of reductions in this area are based on complete information systems. Though one of the extended relations, similarity relation, has been pre- sented in incomplete information systems, which do exist in real world, its reduction approach has not been examined. In this paper, based on similarity relation, the upper and lower approximation reduction are defined in incomplete information systems. The judgment theorems with respect to the consistent sets of the upper and lower approxima- tion reduction are studied, their discernibility matrices are obtained and the approaches of the upper and lower ap- proximation reduction based on discernibility matrices are presented. To overcome its drawback of NP-hard time com- plexity, two heuristic algorithms based on significance of attributes are proposed.
Potential performance bottleneck in Linux TCP
Authors: Wenji Wu, Matt Crawford
Venue: International Journal of Communication Systems (2007)

Transmission control protocol (TCP) is the most widely used transport protocol on the Internet today. Over the years, especially recently, due to requirements of high bandwidth transmission, various approaches have been proposed to improve TCP performance. The Linux 2.6 kernel is now preemptible. It can be interrupted mid-task, making the system more responsive and interactive. However, we have noticed that Linux kernel preemption can interact badly with the performance of the networking subsystem. In this paper, we investigate the performance bottleneck in Linux TCP. We systematically describe the trip of a TCP packet from its ingress into a Linux network end system to its final delivery to the application; we study the performance bottleneck in Linux TCP through mathematical modelling and practical experiments; finally, we propose and test one possible solution to resolve this performance bottleneck in Linux TCP. Copyright &copy; 2007 John Wiley & Sons, Ltd.
The IUPS Physiome Project
Authors: P. J. Hunter
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The Physiome Project of the International Union of Physiological Sciences (IUPS) is attempting to provide a comprehensive framework for modelling the physiology of the human body using multi-scale computational methods which can incorporate the biochemistry, biophysics and anatomy of cells, tissues and organs. A major goal of the project is to use computational modelling to analyse integrative biological function in terms of underlying structure and molecular mechanisms. It is an internationally collaborative open-source project that is providing a public domain framework for computational physiology, including the development of modeling standards, computational tools and web-accessible databases of models of structure and function at all spatial scales [1-4]. It aims to develop an infrastructure for linking models of biological structure and function across multiple levels of spatial organization and multiple time scales.
Human trials: an experiment in intermedia performance
Authors: Josephine Anstey, Sarah Bay-Cheng, Dave Pape, Stuart C. Shapiro
Venue: Computers in Entertainment (CIE) (2007)

Human Trials is simultaneously a public/private and embodied/disembodied performance. One user enters an immersive virtual environment and is led on an absurd quest. The challenges appear to be about control and the choices one makes in using power; but the games are rigged, the characters are duplicitous, the quest is a decoy, and the underlying test is how to cope with disempowerment. Meanwhile the experience is screened for a voyeuristic audience primed by reality TV. The audience members simultaneously watch multiple viewpoints of the virtual world, while live performers, networked into the virtual environment, attempt to entangle the protagonist in their improvisational machinations. The project combines virtual reality, networking, and artificial intelligence technologies.
A Scheme to reduce the handoff latency using mSCTP in Fast Mobile IPv6
Authors: Jae-Min Lee, Hun-Jung Lim, Jong-Hyouk Lee, Tai-Myoung Chung
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

As improvement of wireless and mobile technologies, mobile devices such as laptops and PDAs are widely used. To support the mobility of such devices, Mobile IPv6 (MIPv6) was proposed. In addition, Fast Mobile IPv6 (FMIPv6) and Hierarchical Mobile IPv6 (HMIPv6) was proposed for the seamless handoff. On the other hands, in transport layer, mobile Stream Control Transport Protocol (mSCTP) was proposed for the mobility support. The Dynamic Address Resolution (DAR) signal in mSCTP provides an IP configuration to the Mobile Node (MN). With the DAR, the MN can change its IP address dynamically without connectionless. In the handoff procedure of FMIPv6, Access Routers (ARs) make the tunnel between them to reduce packet loss during link layer handoff. However, this scheme causes AR's packet forwarding process and buffering overhead. In addition, due to exchange some message to make the tunnel, a few handoff signaling costs and latencies are occurred in FMIPv6. Thus, in this paper, we propose the integrated handoff scheme using mSCTP in FMIPv6 to solve such problems. In the proposed scheme, the tunnel is not created anymore, because the MN uses the DAR signals to the handoff. Therefore, the proposed scheme removes tunneling overhead, a few signaling costs, and latencies. Moreover, the MN not executes a Binding Update (BU) procedure with the Correspondent Node (CN) after link layer handoff, because the MN registers a new IP address to CN in advance. The result of performance evaluation show that the proposed scheme reduces handoff latency about 54% and signaling cost about 45% compared to FMIPv6.
A Framework and Process for Designing Inclusive Technology
Authors: K. Pitula, T. Radhakrishnan
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

First we explain the term "inclusive technology' that was coined in the context of software projects intended for bridging the digital divide. Such projects have come to be known under the umbrella term "ICT4D projects" or Information and Communication Technology for Development projects. Then we argue that traditional software engineering processes are lacking in certain respects when used for ICT4D. To overcome their shortcomings, we propose augmenting traditional software processes to make them suitable for the development of software projects undertaken with a view of bridging the digital divide in a society.