ppxscal/embedding_network huggingface dataset:
A semi-automatic usage-based method for improving hyperlink descriptions in menus
Authors: Vera Hollink, Maarten van Someren, Bob J. Wielinga
Venue: International Journal of Human-Computer Studies (2009)

Users who visit a web page for the first time select links on the basis of the link anchors and the descriptions of the links that are provided on the page. If these descriptions give an inaccurate impression of the underlying pages, users make incorrect choices. In this paper we present a novel algorithm to automatically detect links with problematic descriptions in hierarchical menus on the basis of usage information stored in the sites' log files. The algorithm searches the log files for navigation patterns that show that many users make navigation mistakes at certain points in the site. Repeated mistakes indicate that users do not understand the intentions of a link description. The algorithm distinguishes several types of problematic descriptions and provides recommendations for how problematic descriptions of each type can be improved. The findings of the algorithm can help a webmaster of a site to gain insights in the behavior of the sites' users and to improve the site's menu accordingly. Evaluation in three domains shows that webmasters perceive the analyses made by the algorithm as very helpful for improving sites. Moreover, a user experiment demonstrates that the adaptations made by the webmasters on the basis of the analyses, significantly reduce the number of navigation mistakes.
Data farming around the world overview
Authors: Gary E. Horne, Klaus-Peter Schwierz
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Data Farming combines the rapid prototyping capability inherent in certain simulation models with the exploratory power of high performance computing to rapidly generate insight into questions. The Data Farming process focuses on a more complete landscape of possible system responses, rather than attempting to pinpoint an answer. Data Farming allows decision makers to more fully understand the landscape of possibilities and also consider outliers that may be discovered. Over the past decade, an international community has formed around these ideas. In 2008, International Data Farming Workshop 16 took place in Monterey, California, USA and workshop number 17 was held in Garmisch Partenkirchen, Germany. In addition to a summary of these two workshops, this paper will present an overview of the process that has developed to include the development of both methods and applications in the International Data Farming Community.
Pricing decision and lead time setting in a duopoly semiconductor industry
Authors: I-Hsuan Hong, Hsi-Mei Hsu, Yi-Mu Wu, Chun-Shao Yeh
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Pricing and lead time setting are two important decisions in semiconductor foundry industries. This research considers the competition of a duopoly market consisting of two make-to-order firms in semiconductor foundry industries and presents a model to determine the equilibrium price and lead time of these two competing firms where each firm maximizes its own revenue and is subject to its own constraints in a duopoly market. In the model, customer mean demand rates of two competing firms are assumed as functions of committed lead times and prices provided by these two firms and the market. Furthermore, this paper utilizes a simulated procedure to verify the equilibrium price and lead time obtained by the analytical model presented in this paper.
High-performance, energy-efficient platforms using in-socket FPGA accelerators
Authors: Liu Ling, Neal Oliver, Chitlur Bhushan, Wang Qigang, Alvin Chen, Shen Wenbo, Yu Zhihong, Arthur Sheiman, Ian McCallum, Joseph Grecco, Henry Mitchel, Liu Dong, Prabhat Gupta
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Growing demand for energy-efficient, high-performance systems has resulted in the growth of innovative heterogeneous computing system architectures that use FPGAs. FPGA-based architectures enable designers to implement custom instruction streams executing on potentially thousands of compute elements. Traditionally, FPGAs have been used as compute elements on PCI devices; however, this does not allow the FPGAs to be co-processors. This paper describes a high-performance system architecture that is based on the Intel® Xeon® platform in which one or more FPGAs, acting as application accelerators, replace one or more processors in a dual/multi-processor (DP/MP) platform. The FPGA is thus connected directly to the Front Side Bus (FSB) and enjoys the same privileges as a processor, i.e., full participation in the coherency protocol, unrestricted access to system memory and to other processors via the high bandwidth, and low latency connection to the FSB. In addition, we also describe a software layer called the "Accelerator Abstraction Layer (AAL)", which provides a uniform, hardware- and/or platform-independent application interface. Applications written on AAL can be ported to multiple platforms that have different types of accelerators and the application does not have to be modified. In addition, the AAL also enables the developer/user to reprogram the FPGA on the fly (analogous to an operating system context switch) thereby utilizing the programmable nature of the FPGA. The resulting hardware/software stack creates a flexible and powerful platform for accelerator innovation and deployment.
Modeling of Evolving Knowledge Network with Node Deletion
Authors: Hai-yan Shan, Wen-ping Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

A new type of knowledge evolving model which comprises knowledge-based local world preferential attachment and degree-based node preferential deletion is studied. A series of numerical simulations of the degree distribution of the knowledge networks are presented. The results indicate that the degree distribution of the knowledge networks at first has an approximate state of scale-invariant, and then it turns into an exponential distribution. Moreover, the truncation in p(k) increases as the adding probability pa decreases. In addition, the probability of the numbers having relatively more connections is greater when the adding probability is larger. Finally, we compare the effect of the size of local world on degree distribution.The results of simulations show that the probability of the numbers having relatively larger degree will increases as the size of local world increases which indicate that the connectivity is more and tighter as M increases.
The complex dynamic of conjugate gradient method
Authors: Mohamed Lamine Sahari, Illhem Djellit
Venue: International Journal of Computer Mathematics (2009)

Conjugate gradient method is a root-finding algorithm to non-linear equations. In this paper, we suggest extending this method for a polynomial to the complex plane. Through the experimental and theoretical mathematics method, we drew the following conclusions: (1) the conjugate gradient is a dynamical system with two complex parameters; (2) locally conditions for convergence to any roots of complex functions is given; (3) the conjugate gradient method may fail to converge to all roots for cubic with three simple roots; (4) the boundary of conjugate gradient basins are fractals in some cases, and depends on the parameters; (5) the algorithm is then improved by introducing a method to determine the optimal parameters.
dot . a scene = sinΘ at the sea_tactuaL [si:gak] series #2
Authors: Haemin Kim
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

Can we "see" the world without eyes? Can we "feel" the beauty of visual information, such as type and images, with our hands? Visual communication is the most powerful means by which human beings see, feel, think, and behave in a certain way. For those who can see, being unable to see is beyond imagination. But are they really not able to "see" when deprived of sight?
Web Application Firewalls
Authors: Michael Becher
Venue:  (2007)

Web applications are not protected by today's network level firewalls, because they allow access to TCP port 80 without restrictions. However, many successful attacks today are not on the network level, but on application level. For protecting against application level attacks, a firewall must understand the application protocols, that are used on its open ports. This happens in application level firewalls and for Web application in Web application firewalls. The underlying concepts of Web application firewalls differ much from the concepts of traditional network level firewalls. This book explains the underlying concepts of Web application firewalls. Afterwards, they are applied to a collection of security requirements, that application developers should respect today for developing a secure Web application. A Web application firewall is capable of automatically implementing many of these requirements. As a result, Web application developers can ignore these requirements, because the Web applications firewall already ensures their implementation and therefore the security of the Web application. This book is intended for anyone, who is interested in securing his Web application.
Acceptance of agile methodologies: A critical review and conceptual framework
Authors: Frank K. Y. Chan, James Y. L. Thong
Venue: Decision Support Systems (2009)

It is widely believed that systems development methodologies (SDMs) can help improve the software development process. Nevertheless, their deployment often encounters resistance from systems developers. Agile methodologies, the latest batch of SDMs that are most suitable in dealing with volatile business requirements, are likely to face the same challenge as they require developers to drastically change their work habits and acquire new skills. This paper addresses what can be done to overcome the challenge to agile methodologies acceptance. We provide a critical review of the extant literature on the acceptance of traditional SDMs and agile methodologies, and develop a conceptual framework for agile methodologies acceptance based on a knowledge management perspective. This framework can provide guidance for future research into acceptance of agile methodologies, and has implications for practitioners concerned with the effective deployment of agile methodologies.
Understanding the Effect of Intradie Random Process Variations in Nanometer Domino Logic
Authors: Massimo Alioto, Gaetano Palumbo, Melita Pennisi
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

In this paper, the impact of intradie process variations on the delay of nanometer Domino logic is investigated. Analysis shows that Domino logic circuits suffer from a 2X higher variability compared to static CMOS logic, which translates into a greater speed penalty. The main variability sources of Domino gates at the circuit level are identified and analyzed by means of simple circuit models and Monte Carlo simulations on a 90 nm CMOS technology. The role positive feedback in Domino gates is also discussed in depth as a very important source of delay variations in nanometer technologies.
Modeling and Forecasting of Urban Logistics Demand Based on Support Vector Machine
Authors: Meijuan Gao, Qian Feng
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Because logistics system was an uncertain, nonlinear, dynamic and complicated system, it was difficult to describe it by traditional methods. The support vector machine (SVM) has the ability of strong nonlinear function approach, it has the ability of strong generalization and it also has the feature of global optimization. In this paper, a modeling and forecasting method of urban logistics demand based on regression SVM is presented. The SVM network structure for forecasting of urban logistics is established. Moreover, we propose a self-adaptive parameter adjust iterative algorithm to confirm SVM parameters, thereby enhancing the convergence rate and the forecasting accuracy. With the ability of strong self-learning and well generalization of SVM, the modeling and forecasting method can truly forecast the logistics demand by learning the index information of affect logistics demand. The actual forecasting results show that this method is feasible and effective.
Boolean factoring and decomposition of logic networks
Authors: Alan Mishchenko, Robert Brayton, Satrajit Chatterjee
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut-based view of a logic network, 2) exploiting the uniqueness and speed of disjoint-support decompositions, 3) a new heuristic for speeding these up, 4) extending these to general decompositions, and 5) limiting local transformations to functions with 16 or less inputs so that fast truth table manipulations can be used in all operations. Boolean methods lessen the structural bias of algebraic methods, while still allowing for high speed and multiple iterations. Experimental results on K-LUT networks show an average additional reduction of 5.4% in LUT count, while preserving delay, compared to heavily optimized versions of the same networks.
Modeling and simulation for on-chip power grid networks by locally dominant Krylov subspace method
Authors: Boyuan Yan, Sheldon X.-D. Tan, Gengsheng Chen, Lifeng Wu
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Fast analysis of power grid networks has been a challenging problem for many years. The huge size renders circuit simulation inefficient and the large number of inputs further limits the application of existing Krylov-subspace macromodeling algorithms. However, strong locality has been observed that two nodes geometrically far have very small electrical impact on each other because of the exponential attenuation. However, no systematic approaches have been proposed to exploit such locality. In this paper, we propose a novel modeling and simulation scheme, which can automatically identify the dominant inputs for a given observed node in a power grid network. This enables us to build extremely compact models by projecting the system onto the locally dominant Krylov subspace corresponding to those dominant inputs only. The resulting simulation can be very fast with the compact models if we only need to view the responses of a few nodes under many different inputs. Experimental results show that the proposed method can have at least 100X speedup over SPICE-like simulations on a number of large power grid networks up to 1M nodes.
Graph-based Visualization of Requirements Relationships
Authors: Philipp Heim, Steffen Lohmann, Kim Lauenroth, Jürgen Ziegler
Venue: Proceedings of the 2008 Requirements Engineering Visualization (2008)

Understanding the relationships between require- ments is important in order to understand the requirements themselves. Existing requirements management tools mainly use lists, tables, trees, and matrices to visualize requirements and their interrelations. However, all these visualization forms have a limited capability to show multiple relationships of different types. In this paper, we propose to extend traditional requirements analysis and management by a graph-based visualization that allows to represent multidi- mensional relations in a direct and flexible way. In particular, we propose a special presentation form that enables the exploration of requirements along their relationships and facilitates understanding of dependencies between requirements.
A global map of science based on the ISI subject categories
Authors: Loet Leydesdorff, Ismael Rafols
Venue: Journal of the American Society for Information Science and Technology (2009)

The decomposition of scientific literature into disciplinary and subdisciplinary structures is one of the core goals of scientometrics. How can we achieve a good decomposition? The ISI subject categories classify journals included in the Science Citation Index (SCI). The aggregated journal-journal citation matrix contained in the Journal Citation Reports can be aggregated on the basis of these categories. This leads to an asymmetrical matrix (citing versus cited) that is much more densely populated than the underlying matrix at the journal level. Exploratory factor analysis of the matrix of subject categories suggests a 14-factor solution. This solution could be interpreted as the disciplinary structure of science. The nested maps of science (corresponding to 14 factors, 172 categories, and 6,164 journals) are online at . Presumably, inaccuracies in the attribution of journals to the ISI subject categories average out so that the factor analysis reveals the main structures. The mapping of science could, therefore, be comprehensive and reliable on a large scale albeit imprecise in terms of the attribution of journals to the ISI subject categories. &copy; 2009 Wiley Periodicals, Inc.
Vulnerability of an RFID authentication protocol conforming to EPC Class 1 Generation 2 Standards
Authors: Daewan Han, Daesung Kwon
Venue: Computer Standards Interfaces (2009)

Recently, Chien et al. proposed an RFID authentication protocol, which consists of only the cyclic redundancy code (CRC) and the pseudo-random number generator (PRNG) [H. Chien, C. Chen, Mutual Authentication Protocol for RFID Conforming to EPC Class 1 Generation 2 Standards, Computer Standards & Interfaces, vol. 29, Elsevier, 2007, pp. 254-259]. They claimed that the protocol conforms to current EPC tags, and would be secure against all attacks on RFID systems. However, in this paper, we show that the protocol is not secure; firstly an attacker can impersonate a valid tag temporarily by a single eavesdropping. Secondly the attacker can forge a tag permanently by eavesdropping two consecutive sessions. Finally he can make a valid tag useless (DoS attack) by modifying the second attack slightly. The computational complexities of the attacks are so practicable that Chien et al.'s protocol cannot enhance the RFID security any more than the original EPC standard.
An analytical model for conveyor based amhs in semiconductor wafer fabs
Authors: Dima Nazzal, Andrew Johnson, Hector J. Carlo, Jesus A. Jimenez
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper proposes an analytical model useful in the design of conveyor-based Automated Material Handling Systems (AMHS) to support semiconductor manufacturing. The objective is to correctly estimate the work-in-process on the conveyor and assess the system stability. The analysis approach is based on a queuing model, but takes into account details of the operation of the AMHS including turntables. A numerical example is provided to demonstrate and validate the queuing model over a wide range of operating scenarios. The results indicated that the analytical model estimates the expected work-in-process on the conveyor with reasonable accuracy.
A lossy/lossless compression method for printed typeset bi-level text images based on improved pattern matching
Authors: Hadi Grailu, Mojtaba Lotfizad, Hadi Sadoghi-Yazdi
Venue: International Journal on Document Analysis and Recognition (2009)

Pattern matching is the most widely used technique for the compression of printed bi-level text images. In some printed scripts, letters normally attach to each other, or some letters have a simple relation to each other, or there may be undesired touching characters. Detecting such situations and exploiting them to reduce the library size, has a rather great effect on the compression ratio. In this paper, a lossy/lossless compression method for printed typeset bi-level text images is proposed for archiving purposes. For this, three techniques are proposed. First, the number of library prototypes is reduced by detecting and exploiting the mentioned situations. Second, a new effective encoding scheme is proposed for patterns and numbers. Third, three levels are proposed for lossy compression. Experimental results show that the proposed method works better, as high as 1.4&#x2013;3.3 times in lossy case and 1.2&#x2013;2.7 times in lossless case at 300&#x00a0;dpi, than the best existing compression methods or standards.
A LDPC Coding Scheme for Improving the Satellite ATM Links Performance
Authors: Jinfang Dou, Nan Wang, Jun Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Satellite ATM networks is a new-type broadband satellite communication networks and plays an important role in the global communication networks. However, a major problem encountered for using satellite links to transport ATM cells is the high bit error ratio of satellite links, which severely impact the application of ATM over satellite. Therefore, in order to achieve a fiber-like quality on the satellite links, forward-error-correction codes are important for ATM cells. Considering the error characteristic of satellite links and ATM cell format, a novel LDPC coding scheme that four standard ATM cells being encoded as a whole is presented, which can achieve good performance and do not require to modifying standard ATM protocol. This scheme also makes use of the unequal error protection property of irregular LDPC codes, suitable for stressing protection to ATM cellheader. Experiments show that the scheme proposed can distinctly improve bit-error ratio of satellite links and achieve good coding gain.
Secure multidimensional range queries in sensor networks
Authors: Rui Zhang, Jing Shi, Yanchao Zhang
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Sensor nodes submit data to nearby master nodes which then answer the queries from the network owner on behalf of sensor nodes. Relying on master nodes for data storage and query processing raises severe concerns about data confidentiality and query-result correctness when the sensor network is deployed in hostile environments. In particular, a compromised master node may leak hosted sensitive data to the adversary; it may also return juggled or incomplete query results to the network owner. This paper, for the first time in the literature, presents a suite of novel schemes to secure multidimensional range queries in tiered sensor networks. The proposed schemes can ensure data confidentiality against master nodes and also enable the network owner to verify with very high probability the authenticity and completeness of any query result by inspecting the spatial and temporal relationships among the returned data. Detailed performance evaluations confirm the high efficacy and efficiency of the proposed schemes.
Purpose-Built Languages
Authors: Mike Shapiro
Venue: Queue (2009)

While often breaking the rules of traditional language design, the growing ecosystem of purpose-built "little" langages is an essential part of systems development.