ppxscal/embedding_network huggingface dataset:
Some constructions on the Hermitian surface
Authors: Antonio Cossidente
Venue: Designs, Codes and Cryptography (2009)

In the geometric setting of commuting orthogonal and unitary polarities we construct an infinite family of complete (q + 1)2---spans of the Hermitian surface $${\mathcal {H}(3, q^2)}$$ , q odd. A construction of an infinite family of minimal blocking sets of $${\mathcal {H}(3, q^2)}$$ , q odd, admitting PSL 2(q), is also provided.
The importance and futility of device independence in computer graphics
Authors: Anders Vinberg
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Device independence in computer graphics refers to software that supports all graphics hardware devices. The economic reasons why device independence must be considered mandatory are reviewed in this paper. The ultimate futility of straightforward device independence, because of the widely differing characteristics of different devices, leads to a need for software that adapts intelligently to these characteristics---that has device intelligence. For good results we need not merely technical device intelligence, but also sensitivity to different applications. I coin the phrase layout intelligence for software that thus adapts the graph to the situation and show several examples.
A new approach to bootstrap inference in functional coefficient models
Authors: H. Herwartz, F. Xu
Venue: Computational Statistics Data Analysis (2009)

To infer on functional dependence of regression parameters, a new, factor based bootstrap approach is introduced, that is robust under various forms of heteroskedastic error terms. Modeling the functional coefficient parametrically, the bootstrap approximation of an F-statistic is shown to hold asymptotically. In simulation studies with both parametric and nonparametric functional coefficients, factor based bootstrap inference outperforms the wild bootstrap and pairs bootstrap approach, according to its rejection frequencies under the null hypothesis. Applying the functional coefficient model to a cross sectional investment regression on savings, the saving retention coefficient is found to depend on third variables as the population growth rate and the openness ratio.
Decision making and forecasting with respect to risk: a simulation study for a setup-problem
Authors: Martin Romauch, Walter Laure, Georg Seidel, Christian Almeder
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper, the impact of timing a setup operation on the work-in-process and cycle time is investigated. Using a small example of an reentrant production system, it is shown that there is a tradeoff between reducing the average work-in-process inventory and guaranteeing a smooth operation of the system. Furthermore it is shown, that an early setup may lead to an increased variance of the cycle time, but regarding the number of lots with an extreme excess of cycle time the timing decision has only a minor influence.
An integrated method for predicting damage and residual tensile strength of composite laminates under low velocity impact
Authors: Hai-Po Cui, Wei-Dong Wen, Hai-Tao Cui
Venue: Computers and Structures (2009)

An integrated approach is presented to analyze the whole process of damage initiation and development for composite laminates under impact loading as well as tensile loading after impact using the 3D progressive damage theory. The real impact damage status of composite laminates is employed to analyze the residual tensile strength instead of the artificial premises adopted by traditional methods. This integrated approach can not only improve the prediction accuracy of the ultimate strength but also avoid large numbers of experiments for obtaining the impact damage parameters. A parametric modeling program package based on the analytical method has been developed.
GA-Based Robustness Evaluation Method for Digital Image Watermarking
Authors: G. Boato, V. Conotter, F. G. Natale
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

The present paper proposes a new flexible and effective evaluation tool based on genetic algorithms to test the robustness of digital image watermarking techniques. Given a set of possible attacks, the method finds the best possible un-watermarked image in terms of Weighted Peak Signal to Noise Ratio (WPSNR). In fact, it implements a stochastic search of the optimal parameters to be assigned to each processing operation in order to find the combined attack that removes the watermark while producing the smallest possible degradation of the image in terms of human perception. As a result, the proposed method makes it possible to assess the overall performance of a watermarking scheme, and to have an immediate feedback on its robustness to different attacks. A set of tests is presented, referring to the application of the tool to two known watermarking approaches.
Promoting Diversity in Gaussian Mixture Ensembles: An Application to Signature Verification
Authors: Jonas Richiardi, Andrzej Drygajlo, Laetitia Todesco
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

Classifiers based on Gaussian mixture models are good performers in many pattern recognition tasks. Unlike decision trees, they can be described as stable classifier: a small change in the sampling of the training set will produce not a large change in the parameters of the trained classifier. Given that ensembling techniques often rely on instability of the base classifiers to produce diverse ensembles, thereby reaching better performance than individual classifiers, how can we form ensembles of Gaussian mixture models? This paper proposes methods to optimise coverage in ensembles of Gaussian mixture classifiers by promoting diversity amongst these stable base classifiers. We show that changes in the signal processing chain and modelling parameters can lead to significant complementarity between classifiers, even if trained on the same source signal. We illustrate the approach by applying it to a signature verification problem, and show that very good results are obtained, as verified in the large-scale international evaluation campaign BMEC 2007.
A Novel Identity-Based Multi-Signcryption Scheme
Authors: Jianhong Zhang, Yixian Yang, Xinxin Niu
Venue: International Journal of Distributed Sensor Networks (2009)

Message security and the sender's identity authentication for communication in the open channel is a basic and important technology of the internet. For keeping the message confidential and unforgeable, the sender can use a digital signature algorithm with his private key to sign the message, and then encrypts the signature on the message. Signcryption which was proposed by Zheng et. al in 1997 is a novel cryptographic primitive that simultaneously provides the authentication and encryption in a single logic step and at lower computational costs and communication overheads than the above sign-then-encrypt way. Since then, there are many signcryption schemes proposed. Only recently, a formal security proof model is formalized providing security proof for Zheng's signcryption in the random oracle model. In the ID-based cryptography, the complexity of the managing certificate is reduced. In this work, by combining a multisignature with an ID-based signcryption scheme, we build a security model of multi-signcryption to define confidentiality and unforgeability of the ID-based signcryption scheme and have proposed an ID-based multi-signcryption scheme based on the bilinear pairings to adapt to a multi-user setting. Given a message m, a receiver's identity IDB, and n sender's identities IDA1, IDA2,..., IDAn, for each sender Ai, it executes the followings steps: randomly pick xi ε Zq to compute Ri = xiP and ωi = xiQIDB; send (Ri, ωi) to the other senders by a secure channel; (3)after receiving the other senders (Ri, ωi), Ai computes ω = e(Ppub, Σωj) to set c = H2(ω)≈m and R = ΣRj; compute Si = xiH4(m) + H3(R,ω)SIDAi, where SIDAi is the private key of sender Ai. Then the resulting ciphertext is (c,S,R). To unsigcrypt the ciphertext (c,S,R) in the sender list L = (IDA1, IDA2,..., IDAn), the receiver with identity IDB can compute the following steps to recover and verify the message validity. compute ω = e(R,SIDB) and m = H2(ω)≈c, where SIDB is private key of the receiver; accept the message if and only if the following equation holds [image omitted] By security analysis, we show that our scheme satisfies the two important properties of signcryption: confidentiality and unforgeability, and is proven to have been secure in the random oracle model. The security of the scheme is closely related to the Decisional Bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption. Finally, by analyzing the efficiency of the scheme, we show that our scheme is very efficient, and only one pairing computation is needed in the signcryption phase, three pairing operators are needed in the unsigncrytion phase, and the ciphertext size is about 420 bits.
Dictionary-based program compression on customizable processor architectures
Authors: Jari Heikkinen, Jarmo Takala, Henk Corporaal
Venue: Microprocessors Microsystems (2009)

The size of the program code has become a critical design constraint in embedded systems, especially in handheld devices. Large program codes require large memories, which increase the size and cost of the chip. In addition, the power consumption is increased due to higher memory I/O bandwidth. Program compression is one of the most often used methods to reduce the size of the program code. In this paper, dictionary-based program compression is evaluated on a customizable processor architecture with parallel resources. In addition to code density, the effectiveness of the method is evaluated in terms of area and power consumption. Furthermore, a mechanism is proposed to maintain the programmability after compression. Up to 77% reduction in area and 73% reduction in power consumption of the program memory and the associated control logic were obtained.
Work Breakdown Structures: The Foundation for Project Management Excellence
Authors: Eric S. Norman, Shelly A. Brotherton, Robert T. Fried
Venue:  (2008)

The new standards from the Project Management Institute (PMI) provide guidance and universal principles for the generation, development, and application of the Work Breakdown Structure (WBS). Created by the experts who wrote the PMI WBS Practice Standard, this handbook explains what the standard covers and how to go about successfully implementing the WBS process from start to finish. An included CD contains examples from the book, presentations describing the applications of the content, as well as example documents, matrices, and forms.
Multi-touch interaction for robot control
Authors: Mark Micire, Jill L. Drury, Brenden Keyes, Holly A. Yanco
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Recent developments in multi-touch technologies have exposed fertile ground for research in enriched human-robot interaction. Although multi-touch technologies have been used for virtual 3D applications, to the authors' knowledge, ours is the first study to explore the use of a multi-touch table with a physical robot agent. This baseline study explores the control of a single agent with a multi-touch table using an adapted, previously studied, joystick-based interface. We performed a detailed analysis of users' interaction styles with two complex functions of the multi-touch interface and isolated mismatches between user expectations and interaction functionality.
Stealth measurements for cheat detection in on-line games
Authors: Wu-chang Feng, Ed Kaiser, Travis Schluessler
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

As a result of physically owning the client machine, cheaters in network games currently have the upper-hand when it comes to avoiding detection by anti-cheat software. To address this problem and turn the tables on cheaters, this paper examines an approach for cheat detection based on the use of stealth measurements via tamper-resistant hardware. To support this approach, we examine a range of cheat methods and a number of measurements that such hardware could perform to detect them.
First Passage Time Analysis in Wireless Sensor Networks for SPR and MPR Systems
Authors: Lu Yu, Qiao Wang
Venue: Wireless Personal Communications: An International Journal (2009)

In this paper, we study the performance of Slotted ALOHA in an elementary process in wireless sensor networks, in which sensors are activated by rare events and transmit packets to a single sink node within single hop. The time cost of the process can be viewed as a first passage time and we give the expectation of time and energy cost which is dependent on both the size of active nodes and their transmission rate by a first passage time analysis. Meanwhile, given the size of active nodes n, we demonstrated that the optimal transmission rate &lambda;min(n) by which the first passage time attains its minimum, is nearly $${\sqrt{\log n}/n}$$. Our result indicates that time cost of the process in which each node transmits packet with transmission rate &lambda;min(n) increases nearly linearly with n increasing. We present the maximum likelihood estimate (MLE) of the size of active nodes from the viewpoint of sink nodes so that activated nodes can adjust its transmission rate to improve the performance of the process. Energy dissipation and time cost of the procedure in the channel model of Multi Packet Reception (MPR) are considered also. Numerical results indicate that both time cost and energy consumption of the procedure in MPR channel is superior to that in Single Packet Reception (SPR) channel while the transmission rate near or less than the optimal values with which time costs attain their minimum. Otherwise the energy dissipation in MPR channel is more than that in SPR channel although comparison of time cost in the above two channels reveals the superiority of MPR channel.
A Context-Dependent Objective Coordination Model in Mobile Agent Systems
Authors: Yaying Zhang, Xinhuai Tang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Mobile agent application always consists of multiple agents cooperating with each other to achieve the overall goal. However the world perceived by mobile agent varies from site to site due to agent migration, which induces context-dependent coordination issues. The role-based context-dependent objective coordination model proposed in this paper adopts local programmable reactive tuple space at every mobile agent environment to address the context-dependent coordination problems. Additionally, role mechanism is adopted for access control to prevent unauthorized access. Type system is introduced to formalize this role mechanism. A sample application is discussed to illustrate the proposed mode.
Multi-voltage floorplan design with optimal voltage assignment
Authors: Qian Zaichen, Evangeline F.Y. Young
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

In this paper, we study the multiple voltage assignment (MVA) problem under timing constraints in floorplanning, which is generally an NP-hard problem. We will present an effective value-oriented branch-and-bound based algorithm to solve it optimally in a reasonable amount of time. A convex cost integer dual network flow approach is used to obtain a feasible upper bound solution, while a lower bound is obtained by a linear relaxation of a general formulation of the problem. We then adopt a value-oriented breadth-first branch-and-bound method with upper and lower bounds as described above to search for the optimal solution. Favorable results can be obtained in comparison with previous methods using a general linear programming solver. We integrate this algorithm into a multi-stage floorplanner. At the first stage, an initial floorplan is obtained by simulated annealing using the convex cost integer dual network flow approach as an evaluator. We then perform optimal voltage assignment to this initial floorplan. Finally, a post-processing step is done to modify the floorplan slightly to optimize the power network routing resource before invoking once more the optimal voltage assignment step at the end. Experimental results show that we can improve over the most updated work on this problem [7] by further reducing 6% of power consumption while maintaining the performance on other factors
The Effectiveness of Checksums for Embedded Control Networks
Authors: Theresa C. Maxino, Philip J. Koopman
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Embedded control networks commonly use checksums to detect data transmission errors. However, design decisions about which checksum to use are difficult because of a lack of information about the relative effectiveness of available options. We study the error detection effectiveness of the following commonly used checksum computations: exclusive or (XOR), two's complement addition, one's complement addition, Fletcher checksum, Adler checksum, and cyclic redundancy codes (CRC). A study of error detection capabilities for random independent bit errors and burst errors reveals that XOR, two's complement addition, and Adler checksums are suboptimal for typical network use. Instead, one's complement addition should be used for networks willing to sacrifice error detection effectiveness to reduce compute cost, Fletcher checksum for networks looking for a balance of error detection and compute cost, and CRCs for networks willing to pay a higher compute cost for significantly improved error detection.
A Skin-Color and Template Based Technique for Automatic Ear Detection
Authors: Surya Prakash, Umarani Jayaraman, Phalguni Gupta
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper proposes an efficient skin-color and template based technique for automatic ear detection in a side face image. The technique first separates skin regions from non skin regions and then searches for the ear within skin regions. Ear detection process involves three major steps. First, Skin Segmentation to eliminate all non-skin pixels from the image, second Ear Localization to perform ear detection using template matching approach, and third Ear Verification to validate the ear detection using the Zernike moments based shape descriptor. To handle the detection of ears of various shapes and sizes, an ear template is created considering the ears of various shapes (triangular, round, oval and rectangular) and resized automatically to a size suitable for the detection. Proposed technique is tested on the IIT Kanpur ear database consisting of 150 side face images and gives 94% accuracy.
Lawson - Well Done
Authors: Rita Wind
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In the middle of the desert, no one there, just an empty well ...
Understanding engagement with tangible user interfaces
Authors: Peta Wyeth
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper examines the issues surrounding the successful design and development of tangible technology for optimal engagement in playful activities. At present there is very little data on how, and in what contexts, tangible interactions with technology promote lasting engagement and immersion. The framework at the core of this paper has been designed to guide the effective design of tangible technology for immersive interaction. The paper investigates the relationship between tangible user interfaces (TUI) characteristics of representation and control, and immersive flow experiences produced through balancing skill and challenge in user interaction.
Short communication: Impact of ICT in Environmental Sciences: A citation analysis 1990-2007
Authors: R. Casagrandi, G. Guariso
Venue: Environmental Modelling Software (2009)

Detecting trends on the use of Information and Communication Technologies (ICT) in the domain of environmental sciences is important to foresee new frontiers of modelling and software research. Here we analyze the impact of ICT in scientific papers published from 1990 to 2007 in all ISI journals and in those belonging to the Environmental Sciences category only. We thus determine some expanding, fluctuating or unexploited research directions. Quite unexpectedly, we find that the frequency of occurrence of many, yet not all, information technologies increased at significantly higher rates in the environmental studies than in the general sciences. We also contrast trends in the EMS journal to those of the entire domain and discuss differences in some details. Retrieving pertinent information for the comparison is certainly made difficult by some inconsistency in the use of keywords and the current lack of semantic oriented tools. Nevertheless, we find that this journal is leading the development on some research topics, like decision support systems or information systems.
Symbolic Computation for a Class Vector Field with Double Resonance Hopf Bifurcation
Authors: Yunhai Wang, Jinglong Han
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, by applying a reversible linear transform and a near-identity transformation, we obtain a simplest normal form for a class vector fields with double bifurcation. We have implemented an algorithm in Maple 12 and obtained an example of the further reduced normal forms up to some finite order.
Principles of good software specification and their implications for specification languages
Authors: Robert Balzer, Neil Goldman
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Careful consideration of the primary uses of software specifications leads directly to three criteria for judging specifications, which can then be used to develop eight design principles for "good" specifications. These principles, in turn, result in eighteen implications for specification languages that strongly constrain the set of adequate specification languages and identify the need for several novel capabilities such as historical and future references, elimination of variables, and result specification.
Dataset complexity in gene expression based cancer classification using ensembles of k-nearest neighbors
Authors: Oleg Okun, Helen Priisalu
Venue: Artificial Intelligence in Medicine (2009)

Objective: We explore the link between dataset complexity, determining how difficult a dataset is for classification, and classification performance defined by low-variance and low-biased bolstered resubstitution error made by k-nearest neighbor classifiers. Methods and material: Gene expression based cancer classification is used as the task in this study. Six gene expression datasets containing different types of cancer constitute test data. Results: Through extensive simulation coupled with the copula method for analysis of association in bivariate data, we show that dataset complexity and bolstered resubstitution error are associated in terms of dependence. As a result, we propose a new scheme for generating ensembles of classifiers that selects subsets of features of low complexity for ensemble members, which constitutes the accurate members according to the found dependence relation. Conclusion: Experiments with six gene expression datasets demonstrate that our ensemble generating scheme based on the dependence of dataset complexity and classification error is superior to a single best classifier in the ensemble and to the traditional ensemble construction scheme that is ignorant of dataset complexity.