ppxscal/embedding_network huggingface dataset:
Cueing digital memory: how and why do digital notes help us remember?
Authors: Vaiva Kalnikaitė, Steve Whittaker
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

People are aware of the fact that their memories are fallible. As a result, they spend significant amounts of time preparing for subsequent memory challenges, e.g. by leaving themselves reminders. Recent findings suggest, however, that people's ability to prepare for subsequent retrieval may not always be effective. This paper looks at the efficacy of memory strategies in the context of digital and paper-based note-taking. Prior research has claimed that (a) notes may not always be useful in promoting later retrieval; (b) taking notes may distract people from effectively processing important information. We examined pen and paper note-taking as well as a new generation digital note-taking device ChittyChatty, finding that notes help memory in two ways. First they provide cues that help people retrieve information that they might otherwise forget. Second the act of taking notes helps people to better focus on incoming information even if they never later consult these notes. Finally we found differences between different note-taking strategies. People who take high quality notes remember better than those who focus on exhaustive documentation; taking large volumes of notes decreases the efficiency of retrieval -- possibly because it is more time consuming to scan extensive notes to find relevant retrieval cues.
MUI-free multicarrier CDMA
Authors: Xiang Gui
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A new multicarrier CDMA system is proposed and its complete immunity to multiuser interference in the presence of unknown multipath fading channel is shown analytically.
BragFish: exploring physical and social interaction in co-located handheld augmented reality games
Authors: Yan Xu, Maribeth Gandy, Sami Deen, Brian Schrank, Kim Spreen, Michael Gorbsky, Timothy White, Evan Barba, Iulian Radu, Jay Bolter, Blair MacIntyre
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we present our research on social interaction in co-located handheld augmented reality (AR) games. These games are characterized by shared physical spaces that promote physical awareness among players, and individual gaming devices that support both public and private information. One result of our exploration of the design and evaluation of such games is a prototype called BragFish. Through BragFish, we aim to investigate the connections between the observed game experience (focusing on social and physical interaction) and the designed affordances of our AR handheld game. Our evaluation of BragFish shows that most of our participants form strategies for social play by leveraging visual, aural and physical cues from the shared space. Moreover, we use this as an example to motivate discussions on how to improve social play experiences for co-located handheld games by designing for shared spaces.
The Application Research of e-Government Procurement in China Based on Business Component Framework
Authors: Zheng Qin, Daifeng Li
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

E-Government Procurement is the most important experimental project in the electronic business "11th Five-Year Plan" in China. It is also the most important project in the development of Electronic Government Affair. Based on the analysis of e-Government Procurement in China, the paper considers that introducing BC (business component) theory and business component framework into the construction of e-Government Procurement should be a better solution, as it can solve the problems that block the development of e-Government Procurement in a more convenient way. The paper constructs the business component framework for the domain of e-Government Procurement, analyses the superiority of BC framework and describes a methodology for the applications of BCs in e-Government Procurement. Considering the particular features of e-Government Procurement, the paper thinks that light weight architecture based on J2EE is more suitable. At last, the paper takes PID (Public Inviting Biding) as an example and uses Appfuse and Osworkflow to prove the validity of the framework and methodology.
An integrated infrastructure for monitoring and evaluating agent-based systems
Authors: Christos Dimou, Andreas L. Symeonidis, Pericles A. Mitkas
Venue: Expert Systems with Applications: An International Journal (2009)

Driven by the urging need to thoroughly identify and accentuate the merits of agent technology, we present in this paper, MEANDER, an integrated framework for evaluating the performance of agent-based systems. The proposed framework is based on the Agent Performance Evaluation (APE) methodology, which provides guidelines and representation tools for performance metrics, measurement collection and aggregation of measurements. MEANDER comprises a series of integrated software components that implement and automate various parts of the methodology and assist evaluators in their tasks. The main objective of MEANDER is to integrate performance evaluation processes into the entire development lifecycle, while clearly separating any evaluation-specific code from the application code at hand. In this paper, we describe in detail the architecture and functionality of the MEANDER components and test its applicability to an existing multi-agent system.
Ambient intelligence for entry control
Authors: Erik Dovgan, Matjaž Gams
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Terrorists are an increasing thread in today's world. Access control is an important issue when dealing with this kind of threads. Advanced input sensors based on biometrics and intelligent methods that learn from experience are recently used to recognize terrorists or simply to detect an unusual behavior of regular stuff. We have designed and developed such a system consisting of four independent modules: expert system, micro learning, macro learning and camera. In the experimental set-up, there are four input sensors: a door sensor, an identity card reader, a fingerprint reader and a camera. Each of the four modules produces an explanation that categorizes an event as alarm or normal, and the system proposes the final suggestion with explanation.
Simulation and optimization for construction repetitive projects using promodel and SimRunner
Authors: Chachrist Srisuwanrat, Photios G. Ioannou, Omer Tsimhoni
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We introduce a new approach, called Relative Start and Idle Time (RSIT), to solve probabilistic scheduling problems of construction repetitive projects. RSIT is a process of determining a range of input variables and employing optimization through simulation to solve scheduling problems. RSIT reduces the modeler's effort because it does not heavily rely on manual trial-and-error. The two primary advantages of this approach are: (1) it does not require additional solving algorithm code and (2) it does not impose unnecessary limitations on the simulation model in order to solve the scheduling problem. The new approach is presented in detail and applied to a real past repetitive project of four four-story buildings. Results from RSIT are evaluated and compared to the results from a deterministic approach. The example is modeled in Pro-Model and optimized in SimRunner.
A Novel Heart Rate Detection Algorithm in Ballistocardiogram Based on Wavelet Transform
Authors: Jingjing Jin, Xu Wang, Shilong Li, Yingnan Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The heart's mechanical activity while pumping out blood causes the vibration of physical and the object connecting with physical. The vibration is rhythmically with the heart rate and record as ballistocardiogram (BCG) on the spinal axis of the body. It is able to know human’s heart rate by measuring the vibration. BCG is weak non-stationary random signal and contains a lot of noise caused by the impact of human and equipment. So heart rate detection from the original acquisition BCG is difficult. Through discrete sequence wavelet transform, BCG is preprocessed by translation invariant method based on adaptive threshold wavelet shrinkage. Choosing proper wavelet base and adaptive threshold function, estimating the noise variance are done at the same time. The characteristics of BCG are retained while eliminating noise. Based on de-noised BCG, the heart rate of subject is detected by using pseudo-period detection method. A single channel ECG is recorded synchronously to test the veracity. The result shows that it is the same as heart rate gained from ECG.
Enforcing the use of API functions in linux code
Authors: Julia L. Lawall, Gilles Muller, Nicolas Palix
Venue: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software (2009)

In the Linux kernel source tree, header files typically define many small functions that have a simple behavior but are critical to ensure readability, correctness, and maintainability. We have observed, however, that some Linux code does not use these functions systematically. In this paper, we propose an approach combining rule-based program matching and transformation with generative programming to generate rules for finding and fixing code fragments that should use the functions defined in header files. We illustrate our approach using an in-depth study based on four typical functions defined in the header file include/linux/usb.h.
Multi-component free surface flows and rotating devices in the context of minerals processing
Authors: T. N. Croft, D. McBride, M. Cross, J. E. Gebhardt
Venue: International Journal of Computational Fluid Dynamics (2009)

In analysing the treatment and transport of slurries (i.e. particle loaded fluids) in minerals processing, it is common to come up against significant challenges from the perspective of the computational fluid dynamics (CFD) modelling, especially in trying to optimise their transport-to maintain uniformity of particle distribution or minimise their abrasive effects. These flows are essentially multi-component, non-Newtonian and their context is such that they may well involve complex free surfaces and also be in rotating equipment, as well, of course, involving rather complex geometrical configurations. Here we describe CFD models of some key slurry transport processes using a finite volume unstructured mesh-based code using a range of numerical procedures-algebraic slip models for capturing the particulate behaviour, scalar equation algorithms for the free surfaces and source-sink algorithms for the flow through rotating machinery. Applications of the above phenomena coupled are described together with some of the challenges in configuring CFD models.
Main components of a MPLS recovery approach
Authors: Svetlin Petrov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper discusses some of the main components of an eDirectory integrated Multiprotocol Label Switching (MPLS) recovery approach.
secFleck: A Public Key Technology Platform for Wireless Sensor Networks
Authors: Wen Hu, Peter Corke, Wen Chan Shih, Leslie Overs
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

We describe the design and implementation of a public-key platform, secFleck, based on a commodity Trusted Platform Module (TPM) chip that extends the capability of a standard node. Unlike previous software public-key implementations this approach provides E-Commerce grade security; is computationally fast, energy efficient; and has low financial cost -- all essential attributes for secure large-scale sensor networks. We describe the secFleck message security services such as confidentiality, authenticity and integrity, and present performance results including computation time, energy consumption and cost. This is followed by examples, built on secFleck, of symmetric key management, secure RPC and secure software update.
An N-Dimensional Pseudo-Hilbert Scan for Arbitrarily-Sized Hypercuboids
Authors: Jian Zhang, Sei-ichiro Kamata
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The N-dimensional (N-D) Hilbert curve is a one-to-one mapping between N-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spatial relationship of the N-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, all the sides of the scanned region must have the same size and the length must be a power of two, which limits the application of the Hilbert scan greatly. Thus in order to remove these constraints and improve the Hilbert scan for general application, a nonrecursive N-D Pseudo-Hilbert scan algorithm based on two look-up tables is proposed in this paper. The merit of the proposed algorithm is that implementation is much easier than the original one while preserving the original characteristics. The experimental results indicate that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points, and it also shows the competitive performance of the Pseudo-Hilbert scan in comparison with other common scan techniques. We believe that this novel scan technique undoubtedly leads to many new applications in those areas can benefit from reducing the dimensionality of the problem.
Special topics
Authors: Gene Smith
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

In this session, an integral EDP auditor discusses his function and involvement with data processing and the users of data processing. He shares his views on a wide range of specific EDP areas of activity and involvement. He will relate his concerns to control objectives in the audit methodology utilized for determining that the control objectives are effectively assured. 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
Multicasting in delay tolerant networks: a social network perspective
Authors: Wei Gao, Qinghua Li, Bo Zhao, Guohong Cao
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly impair the effectiveness of data dissemination. Although social-based approaches can be used to address the problem, most existing solutions only focus on forwarding data to a single destination. In this paper, we are the first to study multicast in DTNs from the social network perspective. We study multicast in DTNs with single and multiple data items, investigate the essential difference between multicast and unicast in DTNs, and formulate relay selections for multicast as a unified knapsack problem by exploiting node centrality and social community structures. Extensive trace-driven simulations show that our approach has similar delivery ratio and delay to the Epidemic routing, but can significantly reduce the data forwarding cost measured by the number of relays used.
Information Granulation: A Medical Case Study
Authors: Urszula Kużelewska, Jarosław Stepaniuk
Venue: Transactions on Rough Sets IX (2008)

Granular computing is a multidisciplinary theory rapidly developed in recent years. It provides a conceptual framework for many research fields, among others data mining. Data mining techniques and algorithms focus on knowledge discovery from data. When data labels are unknown one can use methods of exploratory data analysis called clustering algorithms. Clustering algorithms are also useful to find hidden dependencies and patterns in data. In this article granular computing and clustering were implemented in information granulation system SOSIG and applied to exploration of real medical data set. Data granulation in the system can be performed on different levels of resolution. Thereby the granules composed of clusters reflect relationship between objects on distinct levels of details. The clustering in SOSIG is generated automatically - there is no requirement to give a number of groups for division. It eliminates problems present in popular clustering algorithms like selection of correct number of clusters and evaluation of created partitioning. The difficulties are encountered in most partitioning as well as hierarchical methods reducing their practical application.Additionally, this article contains solution generated by SOSIG in comparison with clustering results of algorithms: k-means, hierarchical, EM and DBSCAN. There are used quality indices such as Dunn's, DB, CDbw and SI.
Selecting Sums in Arrays
Authors: Gerth Stølting Brodal, Allan Grønlund Jørgensen
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In an array of n numbers each of the $\binom{n}{2}+n$ contiguous subarrays define a sum. In this paper we focus on algorithms for selecting and reporting maximal sums from an array of numbers. First, we consider the problem of reporting k subarrays inducing the k largest sums among all subarrays of length at least l and at most u. For this problem we design an optimal O(n + k) time algorithm. Secondly, we consider the problem of selecting a subarray storing the k'th largest sum. For this problem we prove a time bound of &theta;(n &middot; max {1,log(k/n)}) by describing an algorithm with this running time and by proving a matching lower bound. Finally, we combine the ideas and obtain an O(n&middot; max {1,log(k/n)}) time algorithm that selects a subarray storing the k'th largest sum among all subarrays of length at least l and at most u.
A program for software quality control
Authors: Paul Oliver
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The Automatic Data Processing Equipment Selection Office (ADPESO) of the Department of the Navy is engaged in a development program for software to be used in the quantification of computer systems selection criteria, and the application of quality control procedures to selected software products.
Focused color intersection with efficient searching for object detection and image retrieval
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: Similarity of color histograms is an important cue for detecting colored objects in complex scenes. It is employed in several applications such as image retrieval, object detection, tracking, etc. Focused color intersection efficiently matches the model against parts of the scene using histogram intersection. We propose an upper bound pruning technique which increases the efficiency of searching for a match by concentrating on more promising regions in the image.
Analytical modeling of thermal noise in deep submicron MOSFETs
Authors: Zhi-Qiang Lu, Feng-Chang Lai
Venue: Analog Integrated Circuits and Signal Processing (2009)

An analytical modeling of MOSFETs channel noise is proposed by considering short-channel effects of deep submicron MOSFETs, such as mobility degradation, hot carrier, bulk charge, and channel length modulation effect. The model is only dependent on bias, size, and technology of MOSFETs, and hence is suitable for low-noise RF IC design. Noise parameters of MOSFETs are achieved and good agreement between calculated and measured results is demonstrated.
Model checking nash equilibria in MAD distributed systems
Authors: Federico Mari, Igor Melatti, Ivano Salvo, Enrico Tronci, Lorenzo Alvisi, Allen Clement, Harry Li
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

We present a symbolic model checking algorithm for verification of Nash equilibria in finite state mechanisms modeling Multiple Administrative Domains (MAD) distributed systems. Given a finite state mechanism, a proposed protocol for each agent and an indifference threshold for rewards, our model checker returns PASS if the proposed protocol is a Nash equilibrium (up to the given indifference threshold) for the given mechanism, FAIL otherwise. We implemented our model checking algorithm inside the NuSMV model checker and present experimental results showing its effectiveness for moderate size mechanisms.
Nested Partitioning for the Minimum Energy Broadcast Problem
Authors: Sameh Al-Shihabi, Peter Merz, Steffen Wolf
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem by combining Nested Partitioning with Local Search and Linear Programming. The algorithm is benchmarked by solving instances with 20 and 50 nodes where results are compared to either optimum or best results found by an IP solver. In these instances, the proposed algorithm was able to find optimal and near optimal solutions.
A distributed memory parallel Gauss-Seidel algorithm for linear algebraic systems
Authors: Yueqiang Shang
Venue: Computers Mathematics with Applications (2009)

A distributed memory parallel Gauss-Seidel algorithm for linear algebraic systems is presented, in which a parameter is introduced to adapt the algorithm to different distributed memory parallel architectures. In this algorithm, the coefficient matrix and the right-hand side of the linear algebraic system are first divided into row-blocks in the natural rowwise-order according to the performance of the parallel architecture in use. And then these row-blocks are distributed among local memories of all processors through torus-wrap mapping techniques. The solution iteration vector is cyclically conveyed among processors at each iteration so as to decrease the communication. The algorithm is a true Gauss-Seidel algorithm which maintains the convergence rate of the serial Gauss-Seidel algorithm and allows existing sequential codes to run in a parallel environment with a little investment in recoding. Numerical results are also given which show that the algorithm is of relatively high efficiency.
Virtual community 101: know your virtual community and members
Authors: Eunyoung Cheon, JoongHo Ahn
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

As virtual communities (VCs) become prevalent and sophisticated, various kinds of VCs have emerged. Participation is a key factor that decides whether a VC can survive in long run. The more understanding about the members of the VC, the better promotion of the participation can be planned. This study presents the categories to examine entire realms of VCs and members and a framework which presents how VC users' behavior differs across different types of VCs.