ppxscal/embedding_network huggingface dataset:
Experiments in the dynamics of phase coupled oscillators when applied to graph colouring
Authors: Sofianto Lee, Raymond Lister
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

This paper examines the capacity of networks of phase coupled oscillators to coordinate activity in a parallel, distributed fashion. To benchmark these networks of oscillators, we present empirical results from a study of the capacity of such networks to colour graphs. We generalise the update equation of Aihara et al. (2006) to an equation that can be applied to graphs requiring multiple colours. We find that our simple multi-phase model can colour some types of graphs, especially complete graphs and complete k-partite graphs with equal or a near equal number of vertices in each partition. A surprising empirical result is that the effectiveness of the approach appears to be more dependent upon the topology of the graph than the size of the graph.
Secured and Lossless Watermarking Technique for Patent Infringement
Authors: G. Yamuna, D. Sivakumar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

As digital data, digital maps are easy to update, duplicate, and distribute. At the same time, illegal duplication and distribution or forgery of the maps is also easy. This paper proposes a digital watermarking approach used for Patent Infringement. This methodology uses new Shuffling Technique, Composition & Decomposition, and Encryption & Decryption to record the information of a protected primary image and the allied watermarks. The quadtree can aid the processing of watermark and Rijndael provides added security to information. Besides that, we intend a novel architecture for Patent Protection that holds promise for a better compromise between quality and security for emerging digital rights management application.
Martingale families and dimension in P
Authors: Philippe Moser
Venue: Theoretical Computer Science (2008)

We introduce a new measure notion on small complexity classes (called F-measure), based on martingale families, that gets rid of some drawbacks of previous measure notions: it can be used to define dimension because martingale families can make money on all strings, and it yields random sequences with an equal frequency of 0's and 1's. On larger complexity classes (E and above), F-measure is equivalent to Lutz resource-bounded measure. As applications to F-measure, we answer a question raised in [E. Allender, M. Strauss, Measure on small complexity classes, with application for BPP, in: Proc. of the 35th Ann. IEEE Symp. on Found. of Comp. Sci., 1994, pp. 807-818] by improving their result to: for almost every language A decidable in subexponential time, P^A=BPP^A. We show that almost all languages in PSPACE do not have small non-uniform complexity. We compare F-measure to previous notions and prove that martingale families are strictly stronger than @C-measure [E. Allender, M. Strauss, Measure on small complexity classes, with application for BPP, in: Proc. of the 35th Ann. IEEE Symp. on Found. of Comp. Sci., 1994, pp. 807-818], we also discuss the limitations of martingale families concerning finite unions. We observe that all classes closed under polynomial many-one reductions have measure zero in EXP iff they have measure zero in SUBEXP. We use martingale families to introduce a natural generalization of Lutz resource-bounded dimension [J.H. Lutz, Dimension in complexity classes, in: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000, pp. 158-169] on P, which meets the intuition behind Lutz's notion. We show that P-dimension lies between finite-state dimension and dimension on E. We prove an analogue of a Theorem of Eggleston in P, i.e. the class of languages whose characteristic sequence contains 1's with frequency @a, has dimension the Shannon entropy of @a in P.
Boolean Logic and Alternative Information-Processing Devices
Authors: George Bourianoff, Joe E. Brewer, Ralph Cavin, James A. Hutchby, Victor Zhirnov
Venue: Computer (2008)

Emerging research device technologies might first appear in special applications that can extend conventional general-purpose processors along one of several axes. These applications could optimize the performance of future workloads such as recognition, mining, and synthesis by using the unique nonlinear output characteristics associated with the emerging research devices. However, a new device technology might emerge that, by way of first supplementing conventionally scaled CMOS, could eventually offer a highly scalable new information-processing paradigm.
Analysis and processing of decayed log CT image based on multifractal theory
Authors: Lei Yu, Dawei Qi
Venue: Computers and Electronics in Agriculture (2008)

Nondestructive log testing technology is a new subject that has recently seen rapid development. X-ray computed tomography (CT) scanning technology has been applied to the detection of internal defects in logs for the purpose of obtaining prior information that can be used to arrive at better log sawing decisions. Because sawyers currently cannot see the inside of a log until the log faces are revealed by sawing, there is little perceived need to obtain scanned images as detailed as those obtained by CT imaging system. Thus, the recognition of internal defects has become increasingly important. The traditional means of describing objects, based on the well-known Euclidean geometry, is not capable of describing different natural objects and phenomena. On the contrary, fractal geometry and its multifractal extension are new tools which can be used for describing, modeling, analyzing and processing different complex shapes and images. A method in log CT image edge detection based on multifractal theory was applied in this paper. The Holder exponent @a (x,y) of image pixels was computed first, then its multifractal spectrum f (@a) was estimated and different image pixels were classified, with f(@a)=1 corresponding to smoothing edge point and 1@?f(@a)
From privacy methods to a privacy toolbox: Evaluation shows that heuristics are complementary
Authors: Giovanni Iachello, Gregory D. Abowd
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

We describe the two-year-long development and evaluation of the Proportionality Method, a design method intended to aid HCI practitioners in designing advanced IT applications with complex privacy implications. The method is inspired by Data Protection Authorities' (DPA) and Courts' practice and proposes to balance the impact on privacy of IT applications with their usefulness. We discuss the results of an evaluation of the design method to verify its usability, usefulness and effectiveness vis-&agrave;-vis other design methods proposed in the HCI literature to address similar issues. Results suggest that different design methods for privacy highlight different sets of issues and a combination of methods should be employed in a comprehensive design process. We propose to judge design methods based on their overall quantitative and qualitative merits, including the type of application and technology for which they are most fit and their methodological approach. We finally propose to develop a privacy toolbox, that is, a set of heuristic methods that designers can choose from with knowledge and understanding of their relative advantages and limitations.
Automatic dual censoring cell-averaging CFAR detector in non-homogenous environments
Authors: Amir Zaimbashi, Yaser Norouzi
Venue: Signal Processing (2008)

Constant false alarm rate (CFAR) detectors are designed to regulate the false alarm rate against the noise and clutter background whose mean power is unknown and (or) varying. This is accomplished using local threshold estimate of the background observations. When background observations contain irrelevant samples, censoring is warranted to improve detection performance and to regulate the false alarm rate. In this paper, a new CFAR detector composed of an automatic dual censoring algorithm and cell-averaging CFAR detector is proposed. This new detector is named automatic dual censoring cell-averaging (ADCCA)-CFAR. The proposed detector does not require any prior knowledge about the background observation. It uses fuzzy membership function to determine and censor the unwanted samples in the reference window. The performance of the proposed detectors is evaluated and compared with those of the cell-averaging (CA), order statistic (OS) and automatic censoring cell-averaging based on ordered data variability (ACCA-OVD) CFAR detectors. The simulation results show that the ADCCA-CFAR detector not only provides low CFAR loss in homogenous background but also performs robustly in the presence of interfering targets and clutter edge situations.
Weighted pseudo-metric for a fast CBIR method
Authors: R. Ksantini, D. Ziou, B. Colin, F. Dubeau
Venue: Machine Graphics Vision International Journal (2006)

In this paper, a simple and fast querying method for content-based image retrieval is presented. In order to measure the similarity degree between two color images both quickly and effectively, we use a weighted pseudo-metric employing one-dimensional Daubechies decomposition and compression of the extracted feature vectors. In order to improve the discriminatory capacity of the pseudo-metric, we compute its weights using separately a classical logistic regression model and a Bayesian logistic regression model. The Bayesian logistic regression model was shown to be significantly better than the classical logistic regression model at improving the retrieval performance. Experimental results are reported on the WANG and ZuBuD color image databases proposed by [11].
Accurate max-margin training for structured output spaces
Authors: Sunita Sarawagi, Rahul Gupta
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Tsochantaridis et al. (2005) proposed two formulations for maximum margin training of structured spaces: margin scaling and slack scaling. While margin scaling has been extensively used since it requires the same kind of MAP inference as normal structured prediction, slack scaling is believed to be more accurate and better-behaved. We present an efficient variational approximation to the slack scaling method that solves its inference bottleneck while retaining its accuracy advantage over margin scaling. We further argue that existing scaling approaches do not separate the true labeling comprehensively while generating violating constraints. We propose a new max-margin trainer PosLearn that generates violators to ensure separation at each position of a decomposable loss function. Empirical results on real datasets illustrate that PosLearn can reduce test error by up to 25% over margin scaling and 10% over slack scaling. Further, PosLearn violators can be generated more efficiently than slack violators; for many structured tasks the time required is just twice that of MAP inference.
A Progress Report and a Proposal: Interactivity in Ubiquitous Learning Enhanced by Virtual Tutors in e-Learning Contents
Authors: Toshiyuki Yamamoto, Ryo Miyashita
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

It is proposed in this session that the interactivity necessary in ubiquitous learning can be enhanced by the virtual tutor who mediates between the learner and the e-Learning contents. Arousing students' intellectual curiosity and raising their motivation to learn are the two great goals for e-Learning contents developers. It is supposed that the interaction in the communication between the teacher and his/her students in a regular classroom can be maintained in e-Learning with the help of Virtual Tutor, which appears on the learning contents in a timely fashion to give learners advice, encouragement, reminders, and such. The session includes discussions to develop such a system making use of the most updated technology as well as demonstrations of such a system which has been experimented at Department of Media Informatics. It is proved that the learning environment where human interactivity is essential can be reconstructed in terms of the proposed Virtual Tutor.　This paper presentation includes demonstrations of QED as well as a discussion of the importance of interactivity in ubiquitous e-Learning.
Optimum 2-D LOS MIMO Performance Using Omni-directional Antennas Attained through Genetic Algorithms
Authors: Ian B. Haya, Brent R. Petersen, Bruce G. Colpitts
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

The application of genetic algorithm (GA) optimization has been proven to be highly successful in the area of non-linear optimizations. For a Multiple-Input, Multiple-Output (MIMO) wireless communication system, the optimum performance of the users with respect to the arrangement of antennas is a highly non-linear function which a genetic algorithm seems highly suited to. In this paper, a four-by-four MIMO system model is considered using a simplified 2-D LOS radio channel with additive white noise. Placing the users in a known arrangement, the optimum placement of the four antennas is determined through a genetic algorithm optimization using the average MSE of the four users as the fitness function. Initial results show a tendency towards an arrangement in which at least two antennas seen by the all transmitters are separated by a symbol wavelength.
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm
Authors: UmaMaheswari C. Devi, James H. Anderson
Venue: Real-Time Systems (2008)

The earliest-pseudo-deadline-first (EPDF) Pfair scheduling algorithm is less expensive than some other known Pfair algorithms, but is not optimal for scheduling recurrent real-time tasks on more than two processors. In prior work, sufficient per-task weight (i.e., utilization) restrictions were established for ensuring that tasks either do not miss their deadlines or have bounded tardiness when scheduled under EPDF. Implicit in these restrictions is the assumption that the total system utilization may equal the total available processing capacity (i.e., the total number of processors). This paper considers an orthogonal issue, namely, determining a sufficient restriction on the total utilization of a task set for it to be schedulable (i.e., a schedulable utilization bound) under EPDF, assuming that there are no per-task weight restrictions. We prove that a task set with total utilization at most 3M+1/4 is correctly scheduled under EPDF on M processors, regardless of how large each task's weight is. At present, we do not know whether this value represents the worst-case for EPDF, but we do provide a counterexample that shows that it cannot be improved to exceed 86% of the total processing capacity. The schedulable utilization bound we derive is expressed in terms of the maximum weight of any task, and hence, if this value is known, may be used to schedule task sets with total utilization greater than 3M+1/4.
Analysis of System-Level Reliability Factors and Implications on Real-Time Monitoring Methods for Oxide Breakdown Device Failures
Authors: Eric Karl, Dennis Sylvester, David Blaauw
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Continued technology scaling exacerbates the incidence of degradation and failure in integrated circuits due to mechanisms such as oxide breakdown, negative bias temperature instability and electromigration. This work analyzes the impact of different factors on lifetime distributions for the oxide breakdown effect using a novel monte carlo approach based upon the percolation model and BSIM4. Results of the analysis of oxide failure distributions are used to explore real-time lifetime projection and the use of in-situ monitoring circuits. Under an ideal sensor assumption, the work shows that 500-1000 sensors would be needed to provide lifetime projections with error under 8-10%.
Towards optimal distributed consensus
Authors: P. Berman
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

In a distributed consensus protocol all processors (of which t may be faulty) are given (binary) initial values; after exchanging messages all correct processors must agree on one of them. The quality of a protocol is measured here using as parameters the total number of processors n, number of rounds of message exchange r, and maximal message length m, with optima, respectively, of 3t+1, t+1, and 1. Although no known protocol is optimal in all these three aspects simultaneously, the protocols that take further steps in this direction are presented. The first protocol has n>4t, r=t+1, and polynomial message size. The second protocol has n>3t, r=3t+3, and m=2, and it is asymptotically optimal in all three quality parameters while using the optimal number of processors. Using these protocols as building blocks, families of protocols with intermediate quality parameters, offering better tradeoffs than previous results, are obtained. All the protocols work in polynomial time and have succinct descriptions.
Microsoft Word 2007 Mail Merge & Forms Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use mail merge and forms features in Microsoft Office Word 2007. The following topics are covered: Mail Merge: Choosing the Document Type; Recipient Lists - Creating a Recipient List in Word, Selecting an Existing Recipient List, Editing an Existing Recipient List, Selecting and Sorting Recipients; Writing the Document; Creating a Label Document; Using Rules; Previewing the Merge; Merging; The Mail Merge Wizard; Highlighting Merge Fields. Forms: Showing the Developer Tab; Preparing the Form; Inserting Content Controls (Text Fields, Drop Down Lists, Date Pickers etc. ), Setting Content Control Properties - Add a Title, Format Contents Using a Style, Self Destruct Text, Options for Plain Text, Combo Boxes, DatePicker, Building Block Gallery; Design Mode; Changing Placeholder Text; Protecting a Form from Changes; Protecting Only Parts of a Form- Preventing Editing of a Control's Content, Preventing Deletions; Accessing the Form to Fill it Out; Changing the Form Template; Legacy Form Fields; Saving and Printing Data Only for Legacy Form Fields. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Design, field experiments and evaluation of a web-based remote medical care support system
Authors: Akio Koyama, Junpei Arai, Satoshi Sasaki, Leonard Barolli
Venue: International Journal of Web and Grid Services (2008)

In this research, we propose and develop a remote medical care system to support nurses, care managers and care helpers during their work. The proposed system has three functions: a multipoint communication function using video images and voice, vital signs data auto-uploading and referencing function, and a drip infusion monitoring function. In this paper, we present the proposed remote medical care support system and report the field experiment results using the system in a medical care support centre. The experimental results show that the proposed system has a good performance.
The networked manufacture application service platform for the equipment manufacturing industry base in north-east China
Authors: Hong Song, Haibo Shi, Chunjie Zhao, Chang Liu
Venue: International Journal of Computer Integrated Manufacturing (2007)

In this paper, a detailed analysis of the industry structure, characteristics, and demands of the equipment manufacturing industry base in north-east China is given. Two modes of networked manufacturing systems for the industry of north-east China are presented. The system architecture of the networked manufacturing application service platform based on J2EE (Java 2 Platform, Enterprise Edition) is discussed, and its technical characteristics and main functions are given. The workflow-centric customized platform configuration and application process management method are investigated. Application service systems for networked collaborative design and distribution are developed. Finally, the advancement and practicality of the platform are illustrated by a case study.
Implementation of a Modular Mobile Mapping in a Geocomputing Platform for Location-Based Services Using Geographic Recognition
Authors: Jin-Suk Kang, Younghee You, Mee Young Sung
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

This paper discusses the design and implementation of a geocomputing platform for the development of Location-Based Services (LBS) focusing mobile mapping. During the analysis, design, and implementation of the geocomputing platform, an effective method was identified for the real-time processing of geographic information acquired by a camera attached to a PDA. This combines location information given by GPS with man’s ability to recognize the location of objects and their geographical relationship to improve object mapping.
Inside the adaptive enterprise: an information technology capabilities perspective on business process agility
Authors: Paul Patrick Tallon
Venue: Information Technology and Management (2008)

Recent innovations in utility computing, web services, and service-oriented architectures, combined with a growing array of IT skills, have improved firms' ability to be more agile in responding to change. Using the resource-based view of the firm, prior research suggests that IT resources, in isolation, are unlikely to yield superior performance and so as firms try to boost their agility, the question becomes how to configure IT resources to prepare for, or react to, change. In this paper, we posit that managerial IT capabilities based on IT-business partnerships, strategic planning, and ex-post IT project analysis lead to the development of technical IT capabilities associated with a flexible IT infrastructure which in turn drives agility or a firm's ability to react to change in its products and markets. Using data from matched surveys of IT and business executives in 241 firms, we find that managerial and technical capabilities affect agility. In further testing, we reveal that in a stable setting, technical IT capabilities are more important to agility than managerial IT capabilities, while in a dynamic setting, the opposite is true. Thus, for firms operating in volatile markets, effective models of managerial IT governance are essential for delivering superior agility or adaptiveness.
A Strategy for Identifying, Classifying and Prioritizing Improvement and Innovation Actions: A CMMI Level 5 and Six Sigma Approach
Authors: Fca. Márcia G. S. Gonçalves, Carla Ilane Moreira Bezerra, Arnaldo Dias Belchior, Ciro Carneiro Coelho, Carlo Giovano S. Pires
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

To achieve the highest CMMI maturity level, an organization needs to identify problems, improvement opportunities and innovation and to perform actions to solve the problems and implement the innovations and improvements. Six Sigma is a methodology that supports CMMI through a systematic method for problem analysis and process improvement. In this context, this work presents a strategy for identifying, prioritizing and classifying improvement and innovation actions using Six Sigma in compliance withCMMI level 5. It also presents a practical example of the proposed approach.