ppxscal/embedding_network huggingface dataset:
A model academic ethics and integrity policy for computer science departments
Authors: Charles P. Riedesel, Eric D. Manley, Susan Poser, Jitender S. Deogun
Venue: ACM SIGCSE Bulletin (2009)

For decades, US universities and colleges have had policies pertaining to the conduct of their students at the institutional level. These policies are referred to as Academic Integrity Policies or Codes of Conduct. The Code of Ethics, instituted by Association of Computing Machinery (ACM) has been the standard for the computing sciences profession for over 15 years. However, the traditional institution-wide academic integrity policies have not adapted to the complexities that arose from rapid progress in information technology (IT) and thus either fail to address or are in conflict with the nature of problems in computer science education. In this paper, we propose a model for development and implementation of an academic ethics policy (ethics is a broader concept that includes integrity) that addresses the challenges imposed by information technology vis-á-vis the best modern teaching practices in computer sciences and engineering. Implementing policies that are more in line with the methods of industry and compatible with newer educational pedagogies should make the whole educational environment more engaging to students.
HandSense: discriminating different ways of grasping and holding a tangible user interface
Authors: Raphael Wimmer, Sebastian Boring
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

As mobile and tangible devices are getting smaller and smaller it is desirable to extend the interaction area to their whole surface area. The HandSense prototype employs capacitive sensors for detecting when it is touched or held against a body part. HandSense is also able to detect in which hand the device is held, and how. The general properties of our approach were confirmed by a user study. HandSense was able to correctly classify over 80 percent of all touches, discriminating six different ways of touching the device (hold left/right, pick up left/right, pick up at top/bottom). This information can be used to implement or enhance implicit and explicit interaction with mobile phones and other tangible user interfaces. For example, graphical user interfaces can be adjusted to the user's handedness.
When social networks cross boundaries: a case study of workplace use of facebook and linkedin
Authors: Meredith M. Skeels, Jonathan Grudin
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

The use of social networking software by professionals is increasing dramatically. How it is used, whether it enhances or reduces productivity, and how enterprise-friendly design and use might evolve are open questions. We examine attitudes and behaviors in a large, technologically-savvy organization through a broad survey and thirty focused interviews. We find extensive social and work uses, with complex patterns that differ with software system and networker age. Tensions arise when use spans social groups and the organization's firewall. Although use is predominantly to support weak ties whose contribution to productivity can be difficult to prove, we anticipate rapid uptake of social networking technology by organizations.
One Double Levels Error Resilient Scheme of Joint Source and Channel Coding
Authors: Guodong Xue, Shengyin Fan, Bo Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we will consider the joint source and channel coding problem and propose a double-level error resilient scheme of joint source and channel coding. Compared to other joint source and channel coding schemes, we insert one coordination structure named error resilient entropy coding between source coding and channel coding to achieve additional error resilient capability. Using arithmetic coding based on forbidden symbol and standard LDPC code, we prove that, in coding redundancy and computational complexity, our scheme outperforms either separate source and channel coding scheme or joint source and channel coding scheme with synchronization words.
Throughput-optimal configuration of fixed wireless networks
Authors: Aditya Karnik, Aravind Iyer, Catherine Rosenberg
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In this paper, we address the following two questions concerning the capacity and configuration of fixed wireless networks: (i) given a set of wireless nodes with arbitrary but fixed locations, and a set of data flows, what is the max-min achievable throughput? and (ii) how should the network be configured to achieve the optimum? We consider these questions from a networking standpoint assuming point-to-point links, and employ a rigorous physical layer model to model conflict relationships between them. Since we seek capacity results, we assume that the network is operated using an appropriate schedule of conflict-free link activations. We develop and investigate a novel optimization framework to determine the optimal throughput and configuration, i.e., flow routes, link activation schedules and physical layer parameters. Determining the optimal throughput is a computationally hard problem, in general. However, using a smart enumerative technique we obtain numerical results for several different scenarios of interest. We obtain several important insights into the structure of the optimal routes, schedules and physical layer parameters. Besides determining the achievable throughput, we believe that our optimization-based framework can also be used as a tool, for configuring scheduled wireless networks, such as those based on IEEE 802.16.
Modeling individual cognitive structure in contextual information retrieval
Authors: Xuan Tian, Xiaoyong Du, He Hu, Haihua Li
Venue: Computers Mathematics with Applications (2009)

In contextual information retrieval (CIR), the retrieval of information depends on the time and place of the submitting query, history of interaction, task in hand, and many other factors that are not given explicitly, but lie implicitly in the interaction and surroundings of searching, namely the context [P. Ingwersen, N. Belkin, Information retrieval in context, ACM SIGIR Forum 2 (2004)]. A user's individual cognition is one of important contextual factors to help understand his or her personal needs. In this paper, we give a formal definition for a user's individual cognitive structure (ICS) in CIR, and propose an approach called DOSAM to model it. DOSAM is inspired by the spreading activation model of psychology, and built on the domain ontology, while its goal is to get a user's cognitive structure. Cost analysis of construction algorithm shows that it is feasible to get ICS by DOSAM, and personalized search experimental results on a digital library indicate that ICS based search can improve the search effectiveness and a user's satisfaction.
FPGA platform based digital design education
Authors: Dmitri Mihhailov, Margus Kruus, Alexander Sudnitson
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

This paper gives an overview of how the FPGA (field-programmable gate array) technology is integrated into digital design educational process at Tallinn University of Technology (TUT). Paper focuses on the set of laboratory exercises introduced for "Advanced Digital Design" (IAY0080) course taught to postgraduate students, covering equipment, software and methodology, as well as plans for future improvements.
Integration of genetic optimisation and neuro-fuzzy approximation in parametric engineering design
Authors: Kostas Saridakis, Argyris Dentsoras
Venue: International Journal of Systems Science (2009)

The present article introduces a systematic approach that applies soft computing techniques, such as genetic algorithms and neuro-fuzzy approximation, in parametric engineering design, such as genetic algorithms and neuro-fuzzy approximation. A generic design problem representation is utilised and genetic optimisation is used in order to extract the optimal design solution based on customised optimisation criteria. Apart from the extraction of the optimal solution, the genetic optimisation creates records of elite solutions that can be reused as meta-knowledge to enhance the design results in the context of different frameworks. The efficiency of the proposed neuro-fuzzy approximated models and the meta-knowledge supported architectures is evaluated against the conventional and analytical models, on the basis of an example case of parametric design of oscillating conveyors.
Design approach for fast-settling two-stage amplifiers employing current-buffer Miller compensation
Authors: A. Pugliese, F. A. Amoroso, G. Cappuccino, G. Cocorullo
Venue: Analog Integrated Circuits and Signal Processing (2009)

A new settling-time-oriented design strategy for two-stage operational amplifiers with current-buffer Miller compensation is presented. The proposed approach defines a systematic procedure to optimize the amplifier time response, allowing the required speed performances to be achieved without both power wasting and blind efforts for time-consuming trial-and-error design processes. To demonstrate the effectiveness of the methodology, a design example in a commercial 0.35 μm CMOS technology is presented. As shown by circuit and statistical simulations, the proposed strategy proves to be very useful to develop fast-settling operational amplifiers for typical discrete-time applications, such as switched-capacitor filters and ΣΔ analog-to-digital converters.
Stochastic Calculus of Looping Sequences for the Modelling and Simulation of Cellular Pathways
Authors: Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Paolo Tiberi, Angelo Troina
Venue: Transactions on Computational Systems Biology IX (2009)

The paper presents the Stochastic Calculus of Looping Sequences (SCLS) suitable to describe microbiological systems, such as cellular pathways, and their evolution. Systems are represented by terms. The terms of the calculus are constructed by basic constituent elements and operators of sequencing, looping, containment and parallel composition. The looping operator allows tying up the ends of a sequence, thus creating a circular sequence which can represent a membrane.The evolution of a term is modelled by a set of rewrite rules enriched with stochastic rates representing the speed of the activities described by the rules, and can be simulated automatically.As applications, we give SCLS representations of the regulation process of the lactose operon in Escherichia coli and of the quorum sensing in Pseudomonas aeruginosa.A prototype simulator (SCLSm) has been implemented in F# and used to run the experiments. A public version of the tool is available at the url: http://www.di.unipi.it/~milazzo/biosims/.
Implementation of core manufacturing simulation data in aerospace industry
Authors: Roberto F. Lu, Swee Leong, Niles Bengtsson, Björn Johansson, Frank Riddick, Tina Lee, Guodong Shao, Charles McLean, Al Salour, Laurance N. Hazlehurst, Sidney Ly
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This presentation will describe how Boeing implements the Core Manufacturing Simulation Data (CMSD) information model. The presentation will include visualization of manufacturing data for parts and tooling visibility in manufacturing industry. Simulation analyses are prepared by extracting and formatting data from real world production databases. This includes automatic data processing, automatic curve fitting for distribution functions, automatic CMSD file generation, and finally data is automatically fed to simulations.
Numerical Solution of a Class of Boundary Value Problems Arising in the Physics of Josephson Junctions
Authors: Hristo T. Melemov, Todor L. Boyadjiev
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper we propose a method of numerical solution of non-linear boundary value problems for systems of ODE's given on the embedded intervals. The algorithm is based on the continuous analog of Newton method coupled with spline-collocation scheme of fourth order of accuracy. Demonstrative examples of similar problems take place in physics of stacked Josephson junctions with different layers lengths. As a concrete example we consider the problem for calculation the possible distributions of magnetic flux in a system of two magnetically coupled long Josephson junctions. The influence of length's ratio on the main physical properties of basic bound states is investigated numerically. The existence of bifurcations by change the lengths of the layers for some couples of solutions has been proved.
A Location-Based Fault-Tolerant Routing Algorithm for Mobile Ad Hoc Networks
Authors: Jipeng Zhou, Chao Xia
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In mobile ad hoc networks, the normal routing is easily broken by malfunction nodes, routing protocols should have fault tolerant capability to guarantee the delivery of message. A location-based fault tolerant routing algorithm (FTRA) for mobile ad hoc networks is proposed in the paper. The network is divided into grids according to geographical location information. In normal routing, a forwarding node only uses the position information of its destination and its own neighbors to determine the next hops that packet should be forwarded to, the proposedalgorithm is thus very well suited for highly dynamic networks. When there is no usable node at a hop on the normal routing path, the proposed protocol can detour the fault region with only local information of its neighbor grids. The performance of the proposed algorithm is evaluated by means of simulation.
Machine intelligence
Authors: Alex S. Taylor
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Under certain conditions, we appear willing to see and interact with computing machines as though they exhibited intelligence, at least an intelligence of sorts. Using examples from AI and robotics research, as well as a selection of relevant art installations and anthropological fieldwork, this paper reflects on some of our interactions with the kinds of machines we seem ready to treat as intelligent. Broadly, it is suggested that ordinary, everyday ideas of intelligence are not fixed, but rather actively seen and enacted in the world. As such, intelligence does not just belong to the province of the human mind, but can emerge in quite different, unexpected forms in things. For HCI, it is proposed this opens up a new set of possibilities for design; examining the ways intelligence is seen and enacted gives rise to a very different way of thinking about the intersection between human and machine, and thus promotes some radically new types of interactions with computing machines.
Algorithm for Mining Sequential Pattern in Time Series Data
Authors: Chong Zhu, Xiangli Zhang, Jingguo Sun, Bin Huang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Mining sequential pattern in time series data is broadly used in a variety of areas in order to make a prediction, and an appropriate model should be established before the prediction can be done, therefore, the way how to mine out time series pattern from time series database becomes extremely important. Based on data of the time series database, this paper presents a new frequent time series pattern mining algorithm, which constructs a tree-projection at first, then uses priority depth strategy to traversal the tree-projection in order to mine out all the longest frequent patterns, the paper has descripted the new algorithm with pseudo code in detail. Experimental results demostrate that this algorithm has mined out the frequent series, which meets the real-time restraints successfully. Furthermore, under the same condition and different support situation, the new algorithm has obtained the same ruleset as the traditional AprioriAll method but more effective performance.
The role of the intelligent peripheral interface in systems architecture
Authors: I. Dal Allan
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The American National Standards Institute (ANSI) work committees on computer interfaces are actively developing proposed standards that will affect almost all vendors of computers and peripherals. This paper reviews one project, the Intelligent Peripheral Interface (IPI), in particular, and references the application area of the Small Computer Systems Interface (SCSI). The architecture of future computer systems is going to depend in large part on the types of interfaces used, because of the ever-increasing role that peripherals play in systems performance, cost, availability, and reliability. The capability of peripherals dictates system performance---more than the central processor does, in most configurations. The cost of peripherals represents more than half of what the user pays for a system. The interface chosen to interconnect peripherals has a major influence on the cost and performance tradeoffs that a vendor can make. This paper addresses these issues with regard to the ANSI efforts on intelligent interfaces.
On capture power-aware test data compression for scan-based testing
Authors: Jia Li, Xiao Liu, Yubin Zhang, Yu Hu, Xiaowei Li, Qiang Xu
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Large test data volume and high test power are two of the major concerns for the industry when testing large integrated circuits. With given test cubes in scan-based testing, the "don't-care" bits can be exploited for test data compression and/or test power reduction. Prior work either targets only one of these two issues or considers to reduce test data volume and scan shift power together. In this paper, we propose a novel capture power-aware test compression scheme that is able to keep scan capture power under a safe limit with little loss in test compression ratio. Experimental results on benchmark circuits demonstrate the efficacy of the proposed approach.
On path bipancyclicity of hypercubes
Authors: Xie-Bin Chen
Venue: Information Processing Letters (2009)

Assume that P is any path in a bipartite graph G of length k with 2==3 is (2n-4)-path bipancyclicity. In this paper, counterexamples to the lemma are given, therefore, their proof fails. And we show the following result: The n-cube Q"n with n>=3 is (2n-4)-path bipancyclicity but is not (2n-2)-path bipancyclicity, moreover, and a path P of length k with 2=
Finite queueing approximation techniques for analysis of computer systems
Authors: Dimitris A. Protopapas
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Computer systems with finite request sourcing have been analyzed in the past using infinite source queues or an M/M/1/N queue, both of which may lead to large errors. This paper develops approximations to the response times of the M/G/1/N and GI/G/1/N queues, allowing application of these more realistic models in performance analyses of computer systems.
Fuzzy measure based approximate reasoning with distance-based operators
Authors: Márta Takács
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In the paper a distance based operators based approximate reasoning method is represented, applying fuzzy measure. Distance based operators satisfy most of properties as generally defined parametrical operators. Based on this the possible relationship with the integrals based on fuzzy measures is introduced. It can be shown, that the reason used for fuzzy integral introduction is similar to the reasons in approximate reasoning by fuzzy control.
Effects of different fuzzy operators on fuzzy bi-objective cell loading problem in labor-intensive manufacturing cells
Authors: G. A. Süer, F. Arikan, C. Babayigit
Venue: Computers and Industrial Engineering (2009)

In this study, a fuzzy bi-objective cell loading problem in labor-intensive cellular environments is presented and the effects of different fuzzy operators on the model are investigated. The objective functions of the proposed mathematical model for the problem are minimizing the number of the tardy jobs and the minimizing the total manpower needed. The mathematical model determines the number of cells to open and the cell size for each opened cell and assigns products to cells (cell loading) and also determines the sequence of products in each cell simultaneously. Fuzziness stems from the fuzzy aspiration levels attained to both objective functions. To solve the model, fuzzy mathematical programming approach is used and fuzzy achievement function of the model is defined by six different fuzzy operators which are min, fuzzy and, fuzzy or, minimum bounded sum, add, and product. An example problem is solved to represent the performance of the operators. Experimentation shows that the fuzzy and-operator and product-operator are suitable to reach efficient solutions for the problem on hand.
The POD model: Using communities of practice theory to conceptualise student teachers' professional learning online
Authors: Linda Clarke
Venue: Computers Education (2009)

This paper focuses on the broad outcomes of a research project which aimed to analyse and model student teachers' learning in the online components of an initial teacher education course. It begins with discussion of the methodological approach adopted for the case study, which combined conventional data gathering techniques with those which are facilitated using the 'panoptical' tools of the VLE. The author has synthesized case study evidence, learning theory (Community of practice theory) and the advice of a key theoretician, to produce an original model of student teachers' learning online within a professional online district (POD). The most distinctive feature of the POD model is the learning-curriculum dichotomy which recognises the potential of a VLE as a venue in which student teachers, working together in a community of practice, construct their own curriculum (both formal and informal/'hidden'. The paper also examines the key technological and pedagogical issues which affect students' online learning.
Parallel Improved HDTV720p Targeted Propagate Partial SAD Architecture for Variable Block Size Motion Estimation in H.264/AVC
Authors: Yiqing Huang, Zhenyu Liu, Yang Song, Satoshi Goto, Takeshi Ikenaga
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

One hardware efficient and high speed architecture for variable block size motion estimation (VBSME) in H.264 is presented in this paper. By improving the pipeline structure and processing element (PE) circuits, the system latency and hardware cost is reduced, which makes this structure more hardware efficient than the original Propagate Partial SAD architecture. For small and middle frame size picture's coding, the proposed structure can save 12.1% hardware cost compared with original Propagate Partial SAD structure. In the case of HDTV, since small inter modes trivially contribute to the coding quality, we remove modes below 8 × 8 in our design. By adopting mode reduction technique, when the set number of PE array is less than 8, the proposed mode reduction based Propagate Partial SAD structure can work at faster clock speed and consume less hardware cost than widely used SAD Tree architecture. It is more robust to the high speed timing constraint when parallel processing is considered. With TSMC 0.18μm technology in worst work conditions (1.62 V, 125°C), its peak throughput of 8-set PE array structure is 720p@30 Hz with 128 × 64 search range and 5 reference frames. 12 k gates hardware cost can be reduced by our design compared with the parallel SAD Tree architecture.