ppxscal/embedding_network huggingface dataset:
Paths to creativity in security careers
Authors: Gregory B. Newby
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

One of the biggest security challenges faced by organizations and institutions today involves technical, social, structural and educational elements. This challenge is fostering the necessary creativity needed to maintain a business edge, to anticipate and respond to environmental change, to protect against unintended consequences, and to grow. Stakes are high, because a major pattern in security breaches is a creative outsider (or insider!) bypassing the stolid corporate machine. This session will present several approaches to fostering creativity in organizations, with an emphasis on the individual. Such individuals, it is hoped, will be better able to anticipate and cope with diverse security challenges. Three approaches will be presented. First is the hacker spirit. This is "hacker" in terms of creativity, curiosity and skill with systems, not an intruder or criminal. Hackers from Thomas Edison to Steve Wozniak, among many others, invented the foundation for today's technological society. Hackers are often characterized by a healthy distrust for authority, combined with the desire to verify facts for oneself, through formal or informal methods. Hackers are likely originators of new methods for bypassing security systems (though less likely as perpetrators), but more importantly can serve on the inside. Second is detailed understanding of today's complex systems. Cyberinfrastructure is complex, environmental systems are complex, social systems are complex - it takes a broad education and experience to be able to design, understand and repair them. Security challenges tend to come at the boundaries of systems, and conscious efforts are required to foster an interdisciplinary approach. Autodidactism will not produce enough people with the requisite skills, nor will they emerge from silos of disciplinary learning. Instead, broad multidisciplinary training is needed. Third is encouraging creativity in the organization, whether it is a school or university, a business, a government agency, or social organization. For a variety of reasons, recent trends are towards decreased individualism and limitations on freedom of self-expression. This is dangerous to a security posture, because it is likely that potential intruders will be thinking creatively. Courageous, creative, educated, empowered and experienced individuals are a key component to building adaptable and healthy organizations. The message for the people and organizations involved with privacy, security and trust is stark: the types of individuals described here will otherwise be adversaries. 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
Interval estimation of capability index Cpmk for manufacturing processes with asymmetric tolerances
Authors: Y. C. Chang
Venue: Computers and Industrial Engineering (2009)

The index C"p"m"k combines the merits of the three earlier indices C"p, C"p"k, C"p"m and alerts the user if the process variance increases and/or the process mean deviates from its target value. In practice, treat the calculated estimate C@?"p"m"k as true value and ignore the effect on asymmetric tolerances may lead to misinterpretation of process capability. Pearn et al. [Pearn, W. L., Chen, K. S. & Lin, P. C. (1999). On the generalizations of the capability index C"p"m"k for asymmetric tolerances. Far East Journal of Theoretical Statistics, 3(1), 47-66.] introduced a generalization of C"p"m"k, which referred to as C"p"m"k^'', to handle processes with asymmetric tolerances. However, the sampling distribution of the estimator C@?"p"m"k^'' is exceedingly complex and the derivation of an interval estimation of C@?"p"m"k^'' is mathematically intractable. In this paper, we reformulate the explicit formulas and propose a heuristic algorithm to compute a lower confidence bound on C"p"m"k^'', which presents a measure on the minimum capability of the process, to enhance the applicability of the theoretical results. Tables are provided to assist the practitioners for a wide range of real world situation involving processes capability analysis. Equations and tables to estimate approximate sample size necessary to achieve a desired confidence limit with a specified confidence level are also developed. An application example on the trench capacitor etch process is also presented for illustrating the applicability of the generalization.
Facial expressions as game input with different emotional feedback conditions
Authors: Michael Lankes, Stefan Riegler, Astrid Weiss, Thomas Mirlacher, Michael Pirker, Manfred Tscheligi
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

We propose a game design approach that utilizes facial expressions as an input method under different emotional feedback configurations. A study was conducted in a shopping centre to assess our game "EmoFlowers" focusing on user experience and user effectiveness. The study revealed that interaction with a game via facial expression is perceived naturally, is easy to learn, and provides a positive user experience.
Theoretical and experimental research regarding the determination of non-homogenons materials mechanical cutting characteristics
Authors: Iosif Kovacs, Iosif Andras, Marin Silviu Nan, Florin Dumitru Popescu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

This paper presents a method used to process the experimental laboratory data related to the mechanical cutting of rocks by excavator teeth with the use of a software specially designed in this purpose.
Automats in logical optimization
Authors: Mircea Iosif Neamtu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The feeling that the technology based on integrated circuits is slowly reaching its limits is becoming more general and the idea that we need to focus on searching completely different types of computers, e.g. quantum computers or computers based on "molecular processors", is being debated more and more. One of the research directions, mentioned above, is the calculation based on organic moleculs, especially DNA. A series of operations done on the DNA sequences (simple or with two catheti) is being controled better than ever. In 1994, L. Adleman, published the description of the procedure of finding a Hamiltonian way in a graphic, by using the reversibility of some reactions by using DNA. By communicating his realisation, two years later, took place at Princeton the most complex experiment of this type: calculating the sum of two numbers in the second basis, and from that moment on the idea of realising a molcular computer was born, meaning that a new science field was created.
The advent of trusted computer operating systems
Authors: Stephen T. Walker
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The need to trust a computer system processing sensitive information has existed since the earliest uses of computers. As the effectiveness of computer systems has improved, the desire to utilize them in increasingly more important and consequently more sensitive information processing applications has grown rapidly. Sensitive information must be protected from unauthorized access or modification. But without trusted internal access control mechanisms, the computer has to be treated as a device operating at a single sensitivity level.
A Flexible Code Compression Scheme Using Partitioned Look-Up Tables
Authors: Martin Thuresson, Magnus Själander, Per Stenstrom
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Wide instruction formats make it possible to control microarchitecture resources more precisely by the compiler by either enabling more parallelism (VLIW) or by saving power. Unfortunately, wide instructions impose a high pressure on the memory system due to an increased instruction-fetch bandwidth and a larger code working set/footprint.This paper presents a code compression scheme that allows the compiler to select what subset of a wide instruction set to use in each program phase at the granularity of basic blocks based on a profiling methodology. The decompression engine comprises a set of tables that convert a narrow instruction into a wide instruction in a dynamic fashion. The paper also presents a method for how to configure and dimension the decompression engine and how to generate a compressed program with embedded instructions that dynamically manage the tables in the decompression engine.We find that the 77 control bits in the original FlexCore instruction format can be reduced to 32 bits offering a compression of 58% and a modest performance overhead of less than 1% for management of the decompression tables.
A tunable Lyot birefringent filter with variable channel spacing and wavelength using nonlinear polarization rotation in an SOA
Authors: Songnian Fu, P. Shum, Minxue Wang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We experimentally demonstrate a tunable fiber-optical Lyot birefringent comb filter with independent tuning of the channel spacing and wavelength. The filter consists of a fiber-optic programmable differential group delay line (DGDL) and a semiconductor optical amplifier (SOA) sandwiched between two polarizers. The channel spacing of the filter can be tuned by adjusting the programmable DGDL. Using the nonlinear polarization rotation (NPR) effect, the output state of polarization (SOP) of the SOA can be adjusted by varying the power level of the pump light. This results in a change in the phase shift between the transverse electric (TE) and the transverse magnetic (TM) components of the SOA, and hence fast and continuously wavelength tuning of the filter can also be achieved. The wavelength tuning range is up to 50% of the channel spacing when the pump power is increased from -10 dBm to 17 dBm.
More secure remote user authentication scheme
Authors: Sang-Kyun Kim, Min Gyo Chung
Venue: Computer Communications (2009)

Recently, Yoon and Yoo proposed a remote user authentication scheme which is an improvement on Lee-Kim-Yoo's method. However, we find out that Yoon-Yoo's scheme easily reveals a user's password and is vulnerable to both masquerading user attack and masquerading server attack. Yoon-Yoo's scheme is also exposed to stolen verifier attack, because it has to maintain a user database in a remote server. This paper proposes a new remote user authentication scheme that resolves all aforementioned problems, while keeping the merits of Yoon-Yoo's scheme.
Optimizing portfolio tail measures: asymptotics and efficient simulation optimization
Authors: Sandeep Juneja
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured through multi-factor linear model. We address this optimization problem using two broad approaches. We show that a suitably scaled asymptotic of the probability of large losses can be developed that is a simple convex function of the allocated resources. Thus, asymptotically, portfolio allocation problem is approximated by a convex programming problem whose solution is easily computed and provides significant managerial insight. We then solve the original problem using sample average simulation optimization. Since rare events are involved, naive simulation may perform poorly. To remedy this, we introduce change-of-variable based importance sampling technique and develop a single change of measure that asymptotically optimally estimates tail probabilities across the entire space of feasible allocations.
A New Symmetric Key Encryption Algorithm Based on 2-d Geometry
Authors: Mohammad Jabed Morshed Chowdhury, Tapas Pal
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Symmetric Key Cryptography is one of the prominent means of secure data transfer through unreliable channel. It requires less overhead than Public Key Cryptosystem. We present here, a new algorithm based on 2-d geometry using property of circle, and circle-centered angle. It is a block cipher technique but has the advantage of producing fixed size encrypted messages in all cases. It incorporates low computational complexity with fairly high confidentiality
Note: On the complexity of approximating the Hadwiger number
Authors: Martin Wahlén
Venue: Theoretical Computer Science (2009)

Unless P = NP there is no polynomial time approximation scheme (PTAS) for the problem of finding, for a graph G, the largest h such that the complete graph K"h is a minor of G.
Investigating student readiness for computer assisted language learning
Authors: Anelly Kremenska
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Computerized learning form novelty has become an everyday issue for Bulgarian university education. This paper tackles an urgent pedagogical aspect: student preparedness for it in the case with computer assisted language learning (CALL). The study took place at the end of the first semester of a two-semester foreign language (FL) course and is based on the comparison between the quality of students' performance (as a measure of their development towards the goals of the FL course) and the perceived level of satisfaction with the course (as a subjective measure of their accepting the CALL). Conclusions on the importance of the teachers' role in CALL were drawn and future settings discussed in view of the results.
A low-power FPGA based on autonomous fine-grain power-gating
Authors: Shota Ishihara, Masanori Hariyama, Michitaka Kameyama
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This is the first implementation of an FPGA based on autonomous fine-grain power-gating. To cut the power consumption of clock network and detect the activity of the cell efficiently, asynchronous architecture is full exploited. The proposed FPGA is fabricated in a 90nm CMOS process with dual threshold voltages. It is more efficient in power than the synchronous FPGA at less than 30% utilization.
Partitional clustering algorithms for symbolic interval data based on single adaptive distances
Authors: Francisco de A. T. De Carvalho, Yves Lechevallier
Venue: Pattern Recognition (2009)

This paper introduces dynamic clustering methods for partitioning symbolic interval data. These methods furnish a partition and a prototype for each cluster by optimizing an adequacy criterion that measures the fitting between clusters and their representatives. To compare symbolic interval data, these methods use single adaptive (city-block and Hausdorff) distances that change at each iteration, but are the same for all clusters. Moreover, various tools for the partition and cluster interpretation of symbolic interval data furnished by these algorithms are also presented. Experiments with real and synthetic symbolic interval data sets demonstrate the usefulness of these adaptive clustering methods and the merit of the partition and cluster interpretation tools.
Information in the nonstationary case
Authors: Vincent Q. Vu, Bin Yu, Robert E. Kass
Venue: Neural Computation (2009)

Information estimates such as the direct method of Strong, Koberle, de Ruyter van Steveninck, and Bialek (1998) sidestep the difficult problem of estimating the joint distribution of response and stimulus by instead estimating the difference between the marginal and conditional entropies of the response. While this is an effective estimation strategy, it tempts the practitioner to ignore the role of the stimulus and the meaning of mutual information. We show here that as the number of trials increases indefinitely, the direct (or plug-in) estimate of marginal entropy converges (with probability 1) to the entropy of the time-averaged conditional distribution of the response, and the direct estimate of the conditional entropy converges to the time-averaged entropy of the conditional distribution of the response. Under joint stationarity and ergodicity of the response and stimulus, the difference of these quantities converges to the mutual information. When the stimulus is deterministic or nonstationary the direct estimate of information no longer estimates mutual information, which is no longer meaningful, but it remains a measure of variability of the response distribution across time.
A Thinning-free Algorithm for Straight Edge Detection in a Gray-scale Image
Authors: Sanjoy Pratihar, Partha Bhowmick
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

An efficient algorithm to detect the straight edges present in a gray-scale image is proposed.Algorithms to detect curvilinear edges (of possibly uneven thickness) and algorithms to segment a one-pixel thick digital curve into a sequence of straight pieces are found in the literature in several varieties and in several paradigms. However, to the best of our knowledge, there exists no algorithm till date that can detect straight edges in a gray-scale image without thinning. The proposed algorithm uses the novel idea of exponential averaging to achieve a carry-forward of previous edge strengths along the traversed straight edge. The process is computationally attractive, since the underlying operations at an edge point effectively reduce to one right shift and one integer addition. The straightness of an edge is verified from classical chain code properties realizable by simple integer operations, thereby making the algorithm easy for implementation and fast in execution. Experimental results demonstrate its efficiency and robustness.
WIMS 2.0: Enabling Telecom Networks Assets in the Future Internet of Services
Authors: David Moro, David Lozano, Manuel Macias
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

WIMS 2.0 initiative, focalized on convergence of telecom networks with web 2.0, provides mechanisms to offer the unique telecom service assets as part of the future Internet of Services. To achieve this, WIMS 2.0 technological foundation lays on the Open APIs concept: a so-called Telecom Exposure Layer at the operator network provides interfaces to easily integrate telecom capabilities with Internet services. Not withstanding, WIMS 2.0 includes other strategies: the telecom Portable Service Elements, providing a widget-based penetration of personal communication services into the Internet loom of services; the telecom-boosted User Generated Content publication and distribution, exploiting telecom services potential to produce UGC in real-time; and the Thin Clients, providing virtual terminal representations, ubiquitously accessible from any point of the Internet. WIMS 2.0 provides a mid-term view for the immediate evolution towards the future Internet of Services from a telecom-convergent view.
Sharp quadratic majorization in one dimension
Authors: Jan de Leeuw, Kenneth Lange
Venue: Computational Statistics Data Analysis (2009)

Majorization methods solve minimization problems by replacing a complicated problem by a sequence of simpler problems. Solving the sequence of simple optimization problems guarantees convergence to a solution of the complicated original problem. Convergence is guaranteed by requiring that the approximating functions majorize the original function at the current solution. The leading examples of majorization are the EM algorithm and the SMACOF algorithm used in Multidimensional Scaling. The simplest possible majorizing subproblems are quadratic, because minimizing a quadratic is easy to do. In this paper quadratic majorizations for real-valued functions of a real variable are analyzed, and the concept of sharp majorization is introduced and studied. Applications to logit, probit, and robust loss functions are discussed.
Classification-Driven Object-Based Image Retrieval
Authors: Linhui Jia, Leslie Kitchen
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper describes an approach for object-based image retrieval based on classes of objects in images. In this approach, contours of objects are extracted from images and are represented under a scheme which satisfies scale, rotation, and translation invariance. Classifier learning techniques are used to classify objects in images into different classes. Image similarity calculation is performed based on class information of objects. Experimental results show that the method is effective and efficient.
Auditory icon and earcon mobile service notifications: intuitiveness, learnability, memorability and preference
Authors: Stavros Garzonis, Simon Jones, Tim Jay, Eamonn O'Neill
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

With an ever increasing number of mobile services, meaningful audio notifications could effectively inform users of the incoming services while minimising undesired and intrusive interruptions. Therefore, careful design of mobile service notification is needed. In this paper we evaluate two types of audio (auditory icons and earcons) as mobile service notifications, by comparing them on 4 measures: intuitiveness, learnability, memorability and user preference. A 4-stage longitudinal evaluation involving two lab experiments, a field study and a web-based experiment indicated that auditory icons performed significantly better in all measures. Implications for mobile audio notification design are presented.
A GIS-Based Evaluation on Sensitivity of Soil Erosion in Yishusi River Watershed
Authors: Jia Yan, Jun Du, Chongsheng Xue, Qinghua Yang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Soil erosion sensitivity is limited by a number of factors, including precipitation, relief, soil quality, vegetation and human activity. With reference to domestic and international work on the assessment of sensitivity to soil erosion and to the natural environment characteristics of Yishusi River watershed, the primary influences on and sensitivity grades of soil erosion are determined. The Soil erodibility factor and vegetation factor values used for soil erosion sensitivity evaluation are obtained by interpreting Landsat TM image data, the rainfall erosion force factor map and slop map are obtained by Digitizing and space analyzes in GIS; We evaluated the factors controlling sensitivity to soil erosion and classified areas according to sensitivity by analyzing the reasons for erosion by GIS. The space distributing of all classificatory soil erosion sensitivity evaluation of Yishusi River watershed is analysized. The results showed that 15.74 percent of the total land(approximately 4987.88km2) are maintaining at high or extremity sensitivity, 53.12 percent of the total land(approximately 16836.39km2) are maintaining at moderate sensitivity,31.14 percent of the total land(approximately 9870.88km2) are maintaining at mild or none sensitivity; it concludes that entire soil erosion sensitivity of Yishusi River watershed is high. At last, this article gives some suggestions and measures for the worse situation. This article is able to support the practice work of soil erosion prevention, monitoring management as well as the land use in watershed. Meanwhile, the development of the index system can also benefit the theory of watershed planning and management.