ppxscal/embedding_network huggingface dataset:
Virtual woodcuts from images
Authors: V. B. Mello, C. R. Jung, M. Walter
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We present in this paper a technique for synthesizing virtual woodcuts based on real images. Woodcuts are an ancient form of art in which an image is printed from a block of carved wood. Our solution is fully automatic, but it also allows a great deal of user control if desired. Given an input image, our solution will synthesize an artistic woodcut from this image. Previous work on this topic has mainly relied on simulation of the actual physical interaction process between wood, ink, and paper, whereas we present a consistent solution based on four steps: image segmentation, computation of orientation fields, generation of strokes, and final rendering. Although some non-photorealistic rendering work could be possibly extended to approximate woodcut effects, ours is the first consistent approach targeting woodcuts specifically for images. We illustrate the potential of the proposed technique with examples of virtual woodcuts, obtained either automatically or user guided.
Tailoring Software Evolution Process
Authors: Fei Dai, Tong Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Tailoring software process from existing software processes patterns and standards can effectively improve the performance of work process, ensure the quality of final products, avoid high risks, and reduce rework. However, existing researches do not propose a systematic method for tailoring software evolution process. We propose four basic blocks, namely sequence block, selection block, iteration block and concurrency block. Based on basic blocks, we define four software evolution process tailoring operations: adding operation, deleting operation, splitting operation and merging operation. Additionally, the interface between the high-level model and the low-level model is kept consistent when merging or splitting operation is carried out.
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies
Authors: Dimitri DeFigueiredo, Balaji Venkatachalam, S. Felix Wu
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies and obtain theoretical bounds on the performance of any P2P network employing such strategies. These are fundamental limitations that stem from peers unwillingness to cooperate without getting something in return. We show that the number of cooperating peers in a tit-for-tat strategy can, at best, grow linearly in time, as opposed to exponentially for a fully cooperative strategy. However, tit-for-tat strategies are fairer than a fully cooperative strategy. Our results show that there exists a seed capacity threshold for tit-for-tat strategies. Increasing seed capacity beyond this threshold brings significantly reduced marginal gains.
Modeling Genetic Regulatory Networks by Sigmoidal Functions: A Joint Genetic Algorithm and Kalman Filtering Approach
Authors: Haixin Wang, Lijun Qian, Edward Dougherty
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, the problem of genetic regulatory network inference from time series microarray experiment data is considered. A noisy sigmoidal model is proposed to include both system noise and measurement noise. In order to solve this nonlinear identification problem (with noise), a joint genetic algorithm and Kalman filtering approach is proposed. Genetic algorithm is applied to minimize the fitness function and Kalman filter is employed to estimate the weight parameters in each iteration. The effectiveness of the proposed method is demonstrated by using both synthetic data and microarray measurements.
A Software Architecture for Automatic Security Policy Enforcement in Distributed Systems
Authors: Hedi HAMDI, ADEL Bouhoula, Mohamed Mosbah
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Policies, which are widely deployed in networking services (e.g., management, QoS, mobility, etc.), are a promising solution for securing wide distributed systems. However, the adoption of a policy-based approach for security requires an appropriate policy specification and enforcement tools. In fact, A long-standing problem in distributed systems security is how to specify and enforce correctly security policies. In this paper, we mainly focus on how to systematically specify correct policies instead of manually configuring them and how to automatically enforce security policies in distributed systems. A software engineering approach is presented to overcome these issues. This approach is based on design and developpement of a software architecture to automating definition and enforcing policies.
Assessing the traffic ranking of websites with artificial neural network
Authors: Dow-Ming Yeh, Cheng-Chung Li, Shu-Lan Chu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The website evaluation is an essential work in the time when the popularity and the ubiquity of the World Wide Web demonstrate its role in our everyday lives. In the past, researchers evaluated the websites by manpower and heuristic rules. In this study, we propose to assess the traffic ranking of web sites based on certain quantifiable criteria and the application of Artificial Neural Network (ANN). We use ANN to learn the rules of popular websites and compare the results with actualities. Then we infer the possible reasons of popularity from the learning results and re-evaluate the previous evaluation criteria. We hope that this research could present the current development of website evaluation, offer insights to website designers and web masters.
Indirect Tag Search Mechanism for Instruction Window Energy Reduction
Authors: Shingo Watanabe, Akihiro Chiyonobu, Toshinori Sato
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Instruction window is a key component which extracts Instruction Level Parallelism (ILP) in modern out-of-order microprocessors. In order to exploit ILP for improving processor performance, instruction window size should be increased. However, it is difficult to increase the size, since instruction window is implemented by CAM whose power and delay are much large. This paper introduces a low power and scalable instruction window that replaces CAM with RAM. In this window, instructions are explicitly woken up. Evaluation results show that the proposed instruction window decreases performance by only 1.9% on average. Furthermore, dynamic energy is reduced by 67% on average and static power is reduced by 14%.
The PEPA Plug-in Project
Authors: Mirco Tribastone
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We present a GUI-based tool supporting the stochastic process algebra PEPA with modules for performance evaluation through Markovian steady-state analysis, fluid flow analysis, and stochastic simulation.
A Geometrical Feature Based Sensor Fusion Model of GPR and IR for the Detection and Classification of Anti-Personnel Mines
Authors: Bai Kunth Nath, Alauddin Bhuiyan
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The Ground penetrating radar (GPR) and Infrared (IR) imaging have become two established sensors for detecting buried anti-personnel mines (APM) which contain no or a little metal. The paper introduces the GPR and IR techniques briefly and compares the two sensors with respect to their strengths and weaknesses for target detection and emphasizes the necessity of fusion to harness the advantages of each of the methods. We propose a geometrical feature based sensor fusion framework, combining GPR and IR, as an effective technique for detection and classification of APM, which will reduce the false alarm rate significantly. We consider the basic geometrical shape descriptor features of an object and construct a feature vector for each of the objects. These feature vectors are used to train a Probabilistic Neural Network (PNN) for the classification of APMs. The method gives almost perfect detection accuracy.
Comparing the Trust and Security Models of Mobile Agents
Authors: Michail Fragkakis, Nikolaos Alexandris
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Mobile agent systems employ a number of security features to address the various threats. Despite this common need for security, there doesn't seem to exist a generic trust and security model that covers all the levels of their operation and that could be used as a standard. This paper intends to present the advances of modern trust and security models by presenting and comparing the security architecture of four major mobile agent platforms. The conclusions drawn are then used to point out deficiencies of current technology and highlight issues that need to be addressed by future research.
A cell-based molecular communication network
Authors: Tadashi Nakano, Michael Moore, Akihiro Enomoto, Tatsuya Suda, Takako Koujin, Tokuko Haraguchi, Yasushi Hiraoka
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Molecular communication is engineered biological communication (e.g., cell-to-cell signaling) that allows nanomachines (e.g., engineered organisms, artificial devices) to communicate through the use of chemical signals or molecules. In this paper, we describe a cell-based molecular communication network, a class of molecular communication systems in which nanomachines communicate using a cell-cell communication network.
Self-controlled case series analyses: Small-sample performance
Authors: Patrick Musonda, Mounia N. Hocine, Heather J. Whitaker, C. Paddy Farrington
Venue: Computational Statistics Data Analysis (2008)

Second-order expressions for the asymptotic bias and variance of the log relative incidence estimator are derived for the self-controlled case series model in a simplified scenario. The dependence of the bias and variance on factors such as the relative incidence and ratio of risk to observation period are studied. Small-sample performance of the estimator in realistic scenarios is investigated using simulations. It is found that, in scenarios likely to arise in practice, asymptotic methods are valid for numbers of cases in excess of 20-50 depending on the ratio of the risk period to the observation period and on the relative incidence. The application of Monte Carlo methods to self-controlled case series analyses is also discussed.
A semi-automatic realtime calibration technique for a handheld projector
Authors: Vinh Ninh Dao, Kazuhiro Hosoi, Masanori Sugimoto
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

In this paper, a semi-automatic realtime calibration technique for a handheld projector is described. The proposed technique always keeps a shape of a projected screen rectangular on a specified projection surface, while a user continuously changes his standing position or the pose of the projector. The technique is especially useful for a future mobile phone with a built-in projector that allows a user to project its screen onto any surface in any location and share the screen with multiple people. Informal evaluations using the technique have been conducted to identify the level of its acceptability by users and to find problems to be improved. An example entertainment application to explore possibilities of the proposed technique has been developed.
Practices of stigmergy in architectural work
Authors: Lars Rune Christensen
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Actors coordinate their cooperative efforts by acting on the evidence of work previously accomplished. The paper introduces, on the basis of a field study, the concept of stigmergy to the analysis of coordinative practices in architectural work. It distinguishes between practices of stigmergy and articulation work. Stigmergy is understood as coordination achieved by acting directly on the evidence of work previously accomplished and articulation work is understood as second order efforts to coordinate collaborative work. Furthermore, this leads to a distinction between representational artifacts associated with practices of stigmergy and coordination mechanisms in the service of articulation work.
Brace-Daykin type inequalities for intersecting families
Authors: Norihide Tokushige
Venue: European Journal of Combinatorics (2008)

Let n,k and r>=8 be positive integers. Suppose that a family @?@?[n]k satisfies F"1@?...@?F"r0 and n"r such that |@?|@?(r+1)n-r-1k-r+n-r-1k-r-1 holds for all n and k, satisfying n>n"r and |kn-12|
Co-operative handover in 3G System Architecture Evolution
Authors: Gerhard Kuhn, Jochen Eisl, Helmut Becker
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper outlines the challenges and possible solutions for mobility management between 3GPP and non-3GPP access systems. Given the differences between technologies and mobility principles in 3GPP and non-3GPP access networks it is feasible to implement the mobility features between 3GPP and non-3GPP networks in a stepwise approach. This allows on one hand an early market entry of a basic solution and on the other hand a later enhancement aiming at co-operative handover decisions and context aware mobility. The latter enables a mobile node to change point of network attachment in a secure and seamless fashion. In order to enable short term deployment of mobility over heterogeneous access networks, Mobile IPv4 and Mobile IPv6 should be introduced with some additional changes for the handover of non-real-time traffic and non-co-operative handover. In a further step, an enhanced mobility solution shall be introduced which supports a preparation phase including possible pre-authentication before the handover of the transmission path. In conjunction with this approach it is proposed to enable coordination on handover decision between the mobile node and the evolved packet core network.
Restoring "coding with intention" in introductory programming courses
Authors: Alessio Gaspar, Sarah Langevin
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

This descriptive study discusses two conceptual difficulties encountered by students in introductory programming courses regardless of the chosen language or pedagogical approach (e.g. objects, classes or fundamentals first). Firstly, students tend to learn programming by memorizing correct code examples instead of acquiring the programming thought process. Secondly, they tend to read code by "flying" over it at a comfortable altitude while thinking to its assumed intent. While relaxing, this practice fails to train students to develop the rigor to catch bugs in others' or their own code. Both trends result in an almost complete loss of intentionality in the programming activity; un-innovative code is generated by analogy with (or cut and paste from) existing solutions and is then almost randomly modified until "it fits" the minimal tests requirements without real analysis of its flaws. We review and evaluate pedagogical strategies which can be leveraged by instructors to address the above mentioned issues. Namely, we discuss the benefits of various forms of "Live coding" and test-driven pair programming active learning practices.
Web search: from information retrieval to microeconomic modeling
Authors: Prabhakar Raghavan
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In scarcely a decade, web search has gone from simply scaling traditional information retrieval, to a groundswell of new opportunities that are changing marketing as we know it. In this lecture, we begin by reviewing the progress, pointing out that web search is no longer a purely computer sceince problem. We then hint at the role of other disciplines in this ongoing revolution and a number of directions for research.
Gröbner bases with coefficients in rings
Authors: Franz Pauer
Venue: Journal of Symbolic Computation (2007)

This article gives a short introduction to the theory of Grobner bases in a class of rings, which includes rings of differential operators and polynomial rings over commutative noetherian rings. A definition of reduced Grobner bases for these rings is proposed.
A Data Flow Oriented Program Testing Strategy
Authors: J. W. Laski
Venue: IEEE Transactions on Software Engineering (1983)

Some properties of a program data flow can be used to guide program testing. The presented approach aims to exercise use-definition chains that appear in the program. Two such data oriented testing strategies are proposed; the first involves checking liveness of every definition of a variable at the point(s) of its possible use; the second deals with liveness of vectors of variables treated as arguments to an instruction or program block. Reliability of these strategies is discussed with respect to a program containing an error.
Aiding side-channel attacks on cryptographic software with satisfiability-based analysis
Authors: Nachiketh R. Potlapally, Anand Raghunathan, Srivaths Ravi, Niraj K. Jha, Ruby B. Lee
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Cryptographic algorithms, irrespective of their theoretical strength, can be broken through weaknesses in their implementations. The most successful of these attacks are side-channel attacks which exploit unintended information leakage, e.g., timing information, power consumption, etc., from the implementation to extract the secret key. We propose a novel framework for implementing side-channel attacks where the attack is modeled as a search problem which takes the leaked information as its input, and deduces the secret key by using a satisfiability solver, a powerful Boolean reasoning technique. This approach can substantially enhance the scope of side-channel attacks by allowing a potentially wide range of internal variables to be exploited (not just those that are trivially related to the key). The proposed technique is particularly suited for attacking cryptographic software implementations which may inadvertently expose the values of intermediate variables in their computations (even though, they are very careful in protecting secret keys through the use of on-chip key generation and storage). We demonstrate our attack on standard software implementions of three popular cryptographic algorithms: DES, 3DES, and AES. Our attack technique is automated and does not require mathematical expertise on the part of the attacker.
Autonomous Robot Control Using Evidential Reasoning
Authors: QingXiang Wu, David A. Bell, Xi Huang, Rashid H. Khokhar, Guilin Qi, Zhihui Luo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Evidence theory has been widely applied to uncertainty reasoning. In this paper a finite state machine with evidential reasoning is proposed to control autonomous robots. The Khepera robot is used to demonstrate the control system. The experimental results show that the control system is able to automatically control the robot behaviours via evidential control rules, which can be designed by humans or automatically extracted using machine learning approaches. Therefore, the control system provides an efficient approach to transfer human knowledge to an autonomous robot.
Voltage Island Generation under Performance Requirement for SoC Designs
Authors: Wai-Kei Mak, Jr-Wei Chen
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Using multiple supply voltages on a SoC design is an efficient way to achieve low power. However, it may lead to a complex power network and a huge number of level shifters if we just set the cores to operate at their respective lowest voltage levels. We present two formulations for the voltage level assignment problem. The first is exact but takes longer time to compute a solution. The second can be solved much faster with virtually no loss on optimality. In addition, we propose a modification to the traditional floorplanning framework. Unlike previous works [1] [2], we can optimize the total power consumption, the level shifter overhead, and the power network complexity without compromising the wirelength and the chip area. In the experiments, we obtained 17-53% power savings with voltage island generation.
New Applications & Recent Research
Authors: D. Michalopoulos
Venue: Computer (1979)

More compact than previous memories due to the elimination of bulky drive coils, Bell Labs' improved bubble memory will be used to store digitally recorded messages. It will also see service in high- capacity telephone switching systems and in a variety of microprocessor-based terminal equipment. Consumer products such as pocket calculators and programmable microwave ovens may also benefit from the new development.
NSA simplification algorithm: geometrical vs. visual quality
Authors: Frutuoso G. M. Silva
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The model simplification algorithms have a great interest in a variety of areas, since it allow the replacement of large models by approximations with far fewer cells for manipulation and visualization purposes. The quality of the simplified models and the execution times are the main aspects to distinguish the algorithms. Normally the quality evaluation is based on the analysis of geometrical errors of the simplified models but it is not enough to evaluate the visual quality of simplified models. This paper presents a edge collapsing-based simplification algorithm, called NSA, for polygonal models that is faster than the other algorithms found in the literature that use the edge collapse operation. However it makes a good trade-off between time performance and mesh quality. Besides, in some cases, the visual quality of simplified models created by NSA algorithm is superior to the visual quality of simplified models created by other algorithms, particularly for models that have planar zones (CAD models). Some results are compared between NSA and QSlim algorithms to illustrate the geometrical and visual quality of simplified models.