ppxscal/embedding_network huggingface dataset:
A new ant colony optimization algorithm for the multidimensional Knapsack problem
Authors: Min Kong, Peng Tian, Yucheng Kao
Venue: Computers and Operations Research (2008)

The paper proposes a new ant colony optimization (ACO) approach, called binary ant system (BAS), to multidimensional Knapsack problem (MKP). Different from other ACO-based algorithms applied to MKP, BAS uses a pheromone laying method specially designed for the binary solution structure, and allows the generation of infeasible solutions in the solution construction procedure. A problem specific repair operator is incorporated to repair the infeasible solutions generated in every iteration. Pheromone update rule is designed in such a way that pheromone on the paths can be directly regarded as selecting probability. To avoid premature convergence, the pheromone re-initialization and different pheromone intensification strategy depending on the convergence status of the algorithm are incorporated. Experimental results show the advantages of BAS over other ACO-based approaches for the benchmark problems selected from OR library.
A STEP towards realizing Codd's vision of rendezvous with the casual user
Authors: Michael J. Minock
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This demonstration showcases the STEP system for natural language access to relational databases. In STEP an administrator authors a highly structured semantic grammar through coupling phrasal patterns to elementary expressions within a decidable fragment of tuple relational calculus. The resulting phrasal lexicon serves as a bi-directional grammar, enabling the generation of natural language from tuple relational calculus and the inverse parsing of natural language to tuple calculus. This ability to both understand and generate natural language enables STEP to engage the user in clarification dialogs when the parse of their query is of questionable quality. The STEP system is nearing completion and will soon be field tested in several domains.
Classification of Privacy Enhancing Technologies on Life-cycle of Information
Authors: Yeonjung Kang, Hyangjin Lee, Kilsoo Chun, Junghwan Song
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Recently, studies on privacy enhancing technologies have been actively carried out, as the importance of enterprise information, as well as privacy information, is becoming increasingly emphasized. Several organizations and enterprises have been conducting researches sporadically on privacy information technology. However, concept of privacy enhancing technology is not defined yet and there is no particular technology but P3P so far. Therefore, this paper provide classification mythology of privacy enhancing technology based on privacy information Life-cycle. Privacy enhancing technology are classified into 3 technologies. which are operation technology, common based technology and policy/management technology. This technological classification can be break down more specifically by privacy information life cycle.
Truncating the Loop Series Expansion for Belief Propagation
Authors: Vicenç Gómez, Joris M. Mooij, Hilbert J. Kappen
Venue: The Journal of Machine Learning Research (2007)

Recently, Chertkov and Chernyak (2006b) derived an exact expression for the partition sum (normalization constant) corresponding to a graphical model, which is an expansion around the belief propagation (BP) solution. By adding correction terms to the BP free energy, one for each "generalized loop" in the factor graph, the exact partition sum is obtained. However, the usually enormous number of generalized loops generally prohibits summation over all correction terms. In this article we introduce truncated loop series BP (TLSBP), a particular way of truncating the loop series of Chertkov & Chernyak by considering generalized loops as compositions of simple loops. We analyze the performance of TLSBP in different scenarios, including the Ising model on square grids and regular random graphs, and on PROMEDAS, a large probabilistic medical diagnostic system. We show that TLSBP often improves upon the accuracy of the BP solution, at the expense of increased computation time. We also show that the performance of TLSBP strongly depends on the degree of interaction between the variables. For weak interactions, truncating the series leads to significant improvements, whereas for strong interactions it can be ineffective, even if a high number of terms is considered.
Special Feature A Qualitative Assessment of Parallelism in Expert Systems
Authors: R. J. Douglass
Venue: IEEE Software (1985)

Developers envision expert systems that can make up to one billion inferences per second. This will require full utilization of a system's potential for parallel processing.
Exploring a Geographical Dataset with GEOLIS
Authors: Olivier Bedel, Sebastien Ferre, Olivier Ridoux, Erwan Quesseveur
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Geographical data are mainly structured in layers of information. However, this model of organisation is not convenient for navigation inside a dataset, and so limits geographical data exploration to querying. We think information retrieval could be made easier in GIS by the introduction of a navigation based on geographical object properties. For this purpose, we propose a prototype, GEOLIS1, which tightly combines querying and navigation in the search process of geographical data. GEOLIS relies on Logical Information Systems (LIS), which are based on Formal Concept Analysis (FCA) and logics. In this paper, we detail data organisation and navigation process in GEOLIS. We also present the results of an experimentation led on a real dataset.
Using puzzles: problem-solving and abstraction
Authors: SeungEun Cha, DaiYoung Kwon, WonGyu Lee
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Using puzzles in IT is an introductory model that uses many kinds of puzzles, puzzle-like problems and games to illustrate abstraction and problem-solving concepts in IT with hands-on pedagogy. It is difficult for a novice to understand abstraction IT concepts and programming language at introductory step can be challenging. In order to ease the conceptual and language barrier, puzzle was developed for IT education. Puzzle has been used in IT programs in recent years and there are many kinds of puzzles. In this paper, three-dimensional puzzle was used for interests by hands-on activity. Abstraction and problem-solving concepts are parts of 'Programming Fundamentals and Algorithms' in CC2006 curriculum. When a student solves the puzzle, they develop their own problem-solving strategy. By analyzing student's thinking process, it is possible to construct student's thoughts into steps. At each step, a person's thought might differ from others and description of all the steps is referred as 'Think-Aloud'. Aside from developing their own problem-solving strategy, this paper also focuses on student's ability to group puzzles with similar problem-solving strategy and ability to generalize the problem-solving strategy. In 2006, an experiment was conducted which consisted of 25 students who are majoring in Computer Science Education in Korea University. Experimental results showed that students understood abstraction concepts easier by solving Puzzle. In addition, outstanding students had fewer problem-solving steps compared to the rest of the class. It was found that tendency to use more efficient processes promoted the acquisition of hints: analyzing structure, features and constraints of the Puzzle.
CMOS temperature sensor with ring oscillator for mobile DRAM self-refresh control
Authors: Chan-Kyung Kim, Jae-Goo Lee, Young-Hyun Jun, Chil-Gee Lee, Bai-Sun Kong
Venue: Microelectronics Journal (2007)

This paper presents novel low-cost CMOS temperature sensor for controlling the self-refresh period of a mobile DRAM. In the proposed temperature sensor, the temperature dependency of poly resistance is used to generate a temperature-dependent bias current, and a ring oscillator driven by this bias current is employed to obtain the digital code pertaining to on-chip temperature. This method is highly area-efficient, simple and easy for IC implementation as compared to traditional temperature sensors based on bandgap reference. The proposed CMOS temperature sensor was fabricated with an 80nm 3-metal DRAM process, which occupies extremely small silicon area of only about 0.016mm^2 with under 1@mW power consumption for providing 0.7^oC effective resolution at 1 sample/s processing rate. This result indicates that as much as 73% area reduction was obtained with improved resolution as compared to the conventional temperature sensor in mobile DRAM.
Incorporating a PMF-Based Injury Model into a Multi-Agent Representation of Crowd Behavior
Authors: Frederic (Rick) D. McKenzie, Herbie H. Piland,  III, Min Song
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Throughout the years, much research has been conducted on human behavior models that focus on individual intelligent human agents. Fewer multi-agent based models have addressed group or crowd behavior from a psychological and sociological perspective. We have been focused on incorporating crowd behavior models into control force (police and military) simulations and have developed a real-time crowd simulation capable of generating multiple intelligent agent civilians that exhibit a variety of realistic individual and group behaviors at differing levels of fidelity. One important aspect of modeling realistic crowd behaviors is determining the physiological effects of weapons, both non-lethal and lethal alike, on humans. To this end, we present our categories of non-lethal weapons and their physiological effects that need to be represented. Additionally, this paper describes an injury model developed by the University of Pennsylvania and its integration into our Crowd Federate.
Evaluation of the mechanical properties of human liver and kidney through aspiration experiments
Authors: Alessandro Nava, Edoardo Mazza, Frederic Kleinermann, Nick J. Avis, John McClure, Michael Bajka
Venue: Technology and Health Care (2004)

A proper mechanical characterization of soft biological tissues of the human body has a strong impact on several medical applications such as surgical planning, virtual reality simulators, trauma research, and for diagnostic purposes. Adequate experimental data are needed to describe quantitatively the mechanical behaviour of those organs. We present a technique for the acquisition of such data from soft tissues and its post processing, based on a continuum mechanics approach, to determine some parameters of the tissue's mechanical properties. A small tube is applied to the target organ and a weak vacuum is generated inside the tube according to a predefined pressure history. A video camera grabs images of the deformation profile of the aspirated tissue, and a pressure sensor measures the correspondent vacuum level. The images are processed and used to inform the fitting of uniaxial and continuum mechanics models. Whilst the aspiration test device is suitable for in vivo applications, under sterile conditions during open surgery, we hereby present first results obtained by testing cadaveric tissues.
A Controlled Experiment for Selecting Transformations based on Quality Attributes in the context of MDA
Authors: Marcela Genero, Mario Piattini, Silvia Abrahao, Emilio Insfran, Jose Angel Carsi, Isidro Ramos
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

In this paper, we briefly introduce a controlled experiment to investigate the selection of alternative transformation rules through which to obtain UML class diagrams from a Requirements Model [2]. The main goal of this experiment was to determine which of the transformation rules for structural relationships between classes (association (A1), aggregation (A2) and association class (A3)) produces the UML class diagram that is easiest to understand. More details about the transformations and about the experiment are provided in [1]. We focus upon the understandability of UML class diagrams because it is well recognized that if a model is easier to understand it will be easier to maintain, reuse, etc.
Utility-based decision support system for schedule optimization
Authors: I-Tung Yang
Venue: Decision Support Systems (2008)

The present study quantifies the impact of individual preferences of decision makers on schedule optimization and proposes a decision support system (DSS) to account for the diversity in the time-cost tradeoff analysis. The proposed DSS defines the multiattribute utility function based on subjective assessment of one-dimensional utility functions and scaling factors of time and cost. The multiattribute utility function is subsequently optimized by aid of a new particle swarm optimization algorithm. The application of the proposed DSS is demonstrated through case studies. It has been verified, both statistically and subjectively, that the proposed DSS is effective, efficient, and robust. It has also been shown that the proposed DSS outperforms genetic algorithms. The formulation of the proposed DSS is of practical value because it considers, in addition to direct and indirect costs, the amount of liquidated damages and bonus for early completion. Moreover, the formulation has no restriction on the forms of activity time-cost functions and therefore provides the most flexibility.
An empirical study of memory hardware errors in a server farm
Authors: Xin Li, Michael C. Huang, Kai Shen, Lingkun Chu
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

The integrity of system hardware is an important requirement for providing dependable services. Understanding the hardware's failure mechanisms and the error rate is therefore an important step towards devising an effective overall protection mechanism to prevent service failure. In this paper we discuss an on-going case study of memory hardware failures of production systems in a server-farm environment. We present some preliminary results collected from 212 machines. Our observations under a normal, nonaccelerated condition validate the existence of all failure modes modeled in the previous literature: single-cell, row, column, and whole-chip failures. We also provide a quantitative analysis of the error rates.
Proceedings of the 2007 ACM workshop on Quality of protection
Venue: Conference on Computer and Communications Security (2007)

It is our great pleasure to welcome you to the Third Workshop on Quality of Protection (QoP'07), held in association with the 14th ACM Computer and Communications Security Conference, October 29, 2007, in Alexandria, VA (USA). The objective of this workshop series is to help security research progress towards a notion of Quality of Protection in security comparable to the notion of Quality of Service in networking, software reliability, or software measurements and metrics in empirical software engineering. The call for papers attracted 20 submissions. Each paper was assigned to three program committee members and evaluated on the criteria of scientific novelty, importance to the field and technical quality. The program committee accepted 7 full papers, 4 short papers and 1 poster. In addition, the program includes a panel on how to effectively research, assess, and use security metrics, and a keynote speech by Shari Lawrence Pfleeger on how to keep security metrics useful and realistic. from institutions around the world.
Prior Knowledge SVM-based Intrusion Detection Framework
Authors: Gang Zhang, Jian Yin, Zhaohui Liang, YanGuang Cai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In anomaly intrusion detection, normal profile of target system is built with labeled data sets. But it is time consuming and expensive to label data items. Human knowledge can be used to compensate the lack of labeled data. In this paper, we describe a weighted margin SVM (Support Vector Machine) framework incorporating with pre-defined experienced detection rules to build up normal profile. With the redefinition of data item distance on heterogeneous properties, we use a modified version of LIBSVM to perform model training and detection. We use KDDCup99 ID data set for detection and several metrics are defined to explain effect of detection algorithm which shows our detection framework is more accurate and of good generalization ability than the old ones.
A flexible security architecture to support third-party applications on mobile devices
Authors: Lieven Desmet, Wouter Joosen, Fabio Massacci, Katsiaryna Naliuka, Pieter Philippaerts, Frank Piessens, Dries Vanoverberghe
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

The problem of supporting the secure execution of potentially malicious third-party applications has received a considerable amount of attention in the past decade. In this paper we describe a security architecture for mobile devices that supports the flexible integration of a variety of advanced technologies for such secure execution of applications, including run-time monitoring, static verification and proof-carrying code. The architecture also supports the execution of legacy applications that have not been developed to take advantage of our architecture, though it can provide better performance and additional services for applications that are architecture-aware.The proposed architecture has been implemented on a Windows Mobile device with the .NET Compact Framework. It offers a substantial security benefit compared to the standard (state-of-practice) security architecture of such devices, even for legacy applications.
Loss of Significance in Floating Point Subtraction and Addition
Authors: A. Feldstein
Venue: IEEE Transactions on Computers (1982)

We study the loss of significant βits (?base β digits) in floating point addition or subtraction. To do this, we calculate the conditional probability of a post-arithmetic normalization shift of m βits, given an exponent difference of k βits. The study is done for various bases β, under two different assumptions that the operands are selected at random from the logarithmic distribution or from the uniform distribution.
How probes inform and influence the design process
Authors: Andrés Lucero, Tatiana Lashina, Elmo Diederiks, Tuuli Mattelmäki
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

Design and research practitioners have applied probes in their design processes to find new ways of understanding user experience, allowing them to obtain a better understanding of their users and to inspire their designs. Usually in design practice and research, project leaders and managers expect an ultimate solution emerging as a result of probing. However, in most cases such a direct connection is not evident as probes inform and influence the design process in many different ways. We provide illustrative examples of these ways based on a study related to bathroom use for a lighting system. We present a generalization of our findings on how probes can help inform other design processes.
On the etching mechanism of ZrO2 thin films in inductively coupled BCl3/Ar plasma
Authors: Mansu Kim, Nam-Ki Min, Sun Jin Yun, Hyun Woo Lee, Alexander Efremov, Kwang-Ho Kwon
Venue: Microelectronic Engineering (2008)

The etching mechanism of ZrO"2 thin films in BCl"3/Ar plasma was investigated using a combination of experimental and modeling methods. It was found that an increase in the Ar mixing ratio causes the non-monotonic behavior of the ZrO"2 etch rate which reaches a maximum of 41.4nm/min at about 30-35% Ar. Langmuir probe measurements and plasma modeling indicated the noticeable influence of a BCl"3/Ar mixture composition on plasma parameters and active species kinetics that results in non-linear changes of both densities and fluxes for Cl, BCl"2 and BCl"2^+. From the model-based analysis of surface kinetics, it was shown that the non-monotonic behavior of the ZrO"2 etch rate can be associated with the concurrence of chemical and physical pathways in ion-assisted chemical reaction.
Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction
Authors: Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-Xiang Li, Yao-Wen Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Given a set of pins and a set of obstacles on routing layers, a multi-layer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges within layers and vias between layers, and avoids running through any obstacle to construct a Steiner tree with a minimal total cost. The ML-OARSMT problem is very important for many VLSI designs with pins being located in multiple routing layers that contain numerous routing obstacles incurred from IP blocks, power networks, prerouted nets, etc. Therefore, it is desired to develop an effective algorithm for the ML-OARSMT problem. However, there is no existing work on the MLOARSMT problem. In this paper, we first formulate the MLOARSMT problem and identify key different properties of the problem from its single-layer counterpart. Based on the multi-layer obstacle-avoiding spanning graph (ML-OASG), we present the first algorithm to solve the ML-OARSMT problem. Our algorithm can guarantee an optimal solution for any 2-pin net and many higher-pin nets. Experiments show that our algorithm results in 33% smaller total costs on average than a construction-by-correction heuristic which is widely used for Steiner-tree construction in the recent literature.
A Security Engineering Process based on Patterns
Authors: Denis Hatebur, Maritta Heisel, Holger Schmidt
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We present a security engineering process based on security problem frames and concretized security problem frames. Both kinds of frames constitute patterns for analyzing security problems and associated solution approaches. They are arranged in a pattern system that makes dependencies between them explicit. We describe step-by-step how the pattern system can be used to analyze a given security problem and how solution approaches can be found. Further, we introduce a new frame that focuses on the privacy requirement anonymity.
An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem
Authors: Jingui Lu, Ning Fang, Dinghong Shao, Congyan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An improved immune-genetic algorithm is applied to solve the Traveling Salesman Problem (TSP) in this paper. A new selection strategy is incorporated into the conventional genetic algorithm to improve the performance of genetic algorithm. The selection strategy includes three computational procedures: evaluating the diversity of genes, calculating the percentage of genes, and computing the selection probability of genes. Computer numerical experiments on two case studies (21-city and 56-city TSPs) are performed to validate the effectiveness of the improved immune-genetic algorithm. The results show that by incorporating inoculating genes into conventional procedures of genetic algorithm, the number of evolutional iterations to reach an optimal solution can be significantly reduced.