ppxscal/embedding_network huggingface dataset:
Application of Cultural Algorithms to Earliness/Tardiness Flow Shop With Uncertain Processing Time
Authors: Aiqing Yu, Xingsheng Gu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Earliness/Tardiness flow shop with determinate processing time has been tackled by a variety of traditional optimization techniques over the years. In reality, however, processing time is often imprecise while it is critical for the scheduling problem. In this paper, an optimization model with uncertain parameters has been established by employing interval numbers based on possibility degree method to represent uncertain processing time. Then an effective cultural algorithm is proposed to solve the optimal problem. The belief space is specified in terms of traits of scheduling problem. The simulation results suggest the rapid convergence speed.
Designing a 21st and 22nd century fibre broadband access network
Authors: R. P. Davey, D. Payne, P. Barker, K. Smith, M. Wilkinson, P. Gunning
Venue: BT Technology Journal (2007)

DSL technology has been incredibly successful at allowing copper telephony wires to deliver broadband services. However, the physics of copper dictate that as speeds increase further it will be necessary to push optical fibre closer to the customer -- to the cabinet, and ultimately to the premises. Deploying optical fibre to the mass consumer is well known as representing a significant capital investment and will take many years to deploy. It would be fair to say that putting fibre in the residential access network is a `once in a century' investment. There are many different choices of `high fibre' broadband access systems and as technology develops further, this situation is likely to continue. When operators deploy fibre in the access network, it is therefore vital that they do so in a future-proof manner which can support technologies and architectures yet to come, and allow migration and further evolution.
Optimization and Implementation of AVS-M Decoder on ARM
Authors: Baiying Lei, Wenguang Jin, Huifang Zhang, Kailing Hu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

AVS-M is the recent mobile video coding standard of China. Currently, ARM cores are widely used in mobile applications because of their low power consumption. In this paper, a scheme of the AVS-M decoder realtime implementation on 32 bit MCU RISC processor ARM920T (S3C2440) is presented. The algorithm, redundancy, structure and memory optimization methods to implement AVS-M real-time are discussed in detail. The experiment results demonstrate the success of our optimization techniques and the realtime implementation. The ADS, MCPS and simulation results show that the proposed AVS-M decoder can decode the QVGA image sequence in real-time with high image quality and has low complexity and less memory requirement. AVS conformance test result confirms the proposed AVS-M decoder full compliance with AVS. The proposed AVSM decoder can be employed in many real-time applications in the third generation communication.
Image Content Authentication Algorithm Based on Laplace Spectra Feature
Authors: Wan-Li Lv, Ji-Xin Ma, Bin Luo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A new image content authentication algorithm based on Laplace spectra was proposed. Outstanding feature points are extracted from the original image and a cipher point is inserted. A relational graph is then built, and the Laplace spectra of the graph are calculated to serve as image features. The Laplace spectra are quantized then embedded into the original image as a watermark. In the authentication step, the Laplace spectra of the authenticating image are calculated and compared with that of the watermark embedded in the image. If both of the spectra are identical, the image passes the authentication test. Otherwise, the tamper is found. The experimental results show that the proposed authentication algorithm can effectively detect the event and the location when the original image content is tampered viciously.
K-anonymization as spatial indexing: toward scalable and incremental anonymization
Authors: Tochukwu Iwuchukwu, Jeffrey F. Naughton
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing techniques can be used to anonymize data sets. We use this observation to leverage over 20 years of work on database indexing to provide efficient and dynamic anonymization techniques. Experiments with our implementation show that the R-tree index-based approach yields a batch anonymization algorithm that is orders of magnitude more efficient than previously proposed algorithms and has the advantage of supporting incremental updates. Finally, we show that the anonymizations generated by the R-tree approach do not sacrifice quality in their search for efficiency; in fact, by several previously proposed quality metrics, the compact partitioning properties of R-trees generate anonymizations superior to those generated by previously proposed anonymization algorithms.
Application of Concurrent Subspace Design to Shape Design of Autonomous Underwater Vehicle
Authors: Peng Wang, Baowei Song, Yonghu Wang, Lichuan Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The optimization process of Concurrent Subspace Design (CSD) algorithm is reviewed in details. The study is carried out in the framework of the shape design of Autonomous Underwater Vehicle (AUV), and which is divided into two disciplines, i.e., low drag design and low noise design. A Multiobjective, Multidisciplinary Design Optimization (M&MDO) model of the shape design of AUV is developed. An optimization design example of a certain AUV is analyzed based on CSD method. And the same time the approach is applied to Shape Design of AUV for validation. Finally, comparisons with the present experimental data are made. The analytical result shows that the drag and noise of optimal shape are greatly improved, and the CSD method has some important implication for AUV design.
Nonsensitive Data and Approximate Transactions
Authors: M. K. Sinha
Venue: IEEE Transactions on Software Engineering (1983)

A methodology has been proposed for solving database problems requiring only approximate solutions. Data items are classified as sensitive and nonsensitive. An approximate transaction modifies only the nonsensitive data items which need not satisfy strong consistency constraints, and provides results only up to a degree of approximation. Further, it is shown that such an approach improves the performance in situations where transaction conflicts are frequent. Additionally, the methodology provides users as well as data managers with mechanisms to control the precision of the computation, preserving the qualitative characteristics of the data items.
Design Consideration of 6.25 Gbps Signaling for High-Performance Server
Authors: Jian Hong Jiang, Weixin Gai, Akira Hattori, Yasuo Hidaka, Takeshi Horie, Yoichi Koyanagi, Hideki Osone
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

As network data rate increases rapidly, high-speed signaling circuits for server communication pose many design challenges due to various system requirements using different interconnect mediums. This paper discusses main problems and solutions of high-speed circuits for server interconnect. Then, it presents a high-speed circuit implementation for such interconnect using 90nm CMOS technology that achieved data rate at 6.25 Gbps in a backplane environment.
The equitable total chromatic number of the graph HM(Wn)
Authors: Haiying Wang, Jianxin Wei
Venue: Journal of Applied Mathematics and Computing (2007)

The equitable total chromatic number χet(G) of a graph G is the smallest integer k for which G has a total k-coloring such that the number of vertices and edges in any two color classes differ by at most one. In this paper, we determine the equitable total chromatic number of one class of the graphs.
A Measurement-Based Modeling Approach for Network-Induced Packet Delay
Authors: Daniel A. Vivanco, Anura P. Jayasumana
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

An approach is presented to capture and model Internet end-to-end packet delay behavior using ARMA and ARIMA models. Autocorrelation (ACF) and Partial Autocorrelation (PACF) functions are used to identify the most appropriate model and the model order. Impact due to sending rate and packet size of the probe, and the available link capacity on these two metrics are investigated. Results indicate that the models presented reflect accurately the effect of packet correlation induced by the network. Modeling Inter-Packet Gap (IPG) is an alternative for capturing the effect of the network on a packet stream. A methodology for fitting ARMA and ARIMA models to end-to-end packet delay and IPG series is presented.
Security Evaluation for Information Assurance
Authors: Yong-tae Kim, Gil-cheol Park, Tai-hoon Kim, Sang-ho Lee
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In general, threat agents' primary goals may fall into three categories: unauthorized access, unauthorized modification or destruction of important information assets, and denial of authorized access. Security countermeasures are implemented to prevent threat agents from successfully achieving these goals. Because the general systems of today are composed of a number of components such as servers and clients, protocols, services, and so on, the possibility of success of attack may be increased. As though Systems connected to network have become more complex and wide, unfortunately, the researches for the systems are focused on the "performance' or "efficiency'. While most of the attention in system security has been focused on encryption technology and protocols for securing the data transaction, it is critical to note that a weakness (or security hole) in any one of the components may comprise whole system. Security engineering is needed for reducing security holes may be included in the Information systems. This paper proposes a method for securing the Information systems by evaluation of security functions of system component. This paper proposes Information system security evaluation and certification for achieving some level of assurance each owners of their Information systems want to get.
Context Aware Differentiated Services Development with Configurable Business Processes
Authors: Aries Tao, Jiang Yang
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

In order to make business service more flexible and reusable, it is desirable to provide users or applications the same service but with different service quality, differ- ent interaction paths, or with different outcomes. We call this design principle as Service Differentiation. This paper describes a fully functional mechanism where variability is externalized as usage context and context aware policies so that the core business process(es) need not to be altered for any anticipated changes. Service differentiation is re- alized by configured business processes and interfaces, and the dynamic 'binding' between user/application with a spe- cific interface is determined by usage context during service invocation time.
Databases and Units of Measure
Authors: N. H. Gehani
Venue: IEEE Transactions on Software Engineering (1982)

A serious impediment to the integrated use of databases across international boundaries, scientific disciplines and application areas is the use of different units of measure, e.g., miles or kilometers for distance, dollars or rupees for currency, and Btu or kWh for energy. Units of measure are not specified in the data definition language but associated by convention with values in the database. Inconsistent usage of values with different units cannot be checked atuomatically. Retrieval, storage, and manipulation of data values in units other than those associated with the values requires that the user perform the appropriate conversions. This process is inconvenient and error prone. These problems are illustrated by an international database example.
Globally Asynchronous, Locally Synchronous Circuits: Overview and Outlook
Authors: Miloš Krstić, Eckhard Grass, Frank K. Gürkaynak, Pascal Vivet
Venue: IEEE Design Test (2007)

For more than 20 years, significant research effort was concentrated on globally asynchronous, locally synchronous (GALS) design methodologies. But despite several successful implementations, GALS has had little impact on industry products. This article presents different GALS techniques and architectures. The authors also analyze the actual challenges and problems for wider adoption of the currently proposed GALS methods. Their analysis shows that significant improvement can be achieved in terms of system integration and EMI reduction. On the other hand, for power savings, only marginal improvements to the existing techniques can be expected. Additionally, introduction of a GALS approach leads to relatively small area increases, and in some cases even causes certain performance losses. The authors present major examples of GALS implementations. Finally, they outline some directions for future development of GALS techniques and their design flow. It is quite clear that the GALS design and test flow must be improved and more automated. Furthermore, the attendant performance degradations must be limited--for example, high data throughput must be ensured through very low hardware overhead for the GALS circuitry.
A Clarification of the Ontological Status of "Knowledge Roles"
Authors: Sabine Bruaux, Gilles Kassel, Gilles Morel
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach relies on a core problem-solving ontology (OntoKADS) which extends a foundational ontology (DOLCE) and a core ontology in the domain of semiotics (I&DA). In this article, our presentation of OntoKADS focuses on "knowledge roles" - the modeling primitive situated at the interface between domain knowledge and reasoning, and whose ontological status is still much debated. The main contribution of this paper is to propose a coherent, global, ontological framework which enables us to account for this primitive. We also show how the novel characterization of this primitive allows definition of new rules for the construction of expertise models.
An improved adaptive Genetic Algorithm in Optimization of Partner Selection
Authors: Xuesen Ma, Jianghong Han, Zhenchun Wei, Yuefei Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Partner selection is a critical problem in organizing virtual enterprises according to 3 main indexes of cost, credit degree and makespan provided by the candidates. An improved genetic algorithm (AGA) with total fitness ranking-based selection and adaptive operator is presented. Selection based on total fitness ranking make multi-objective problem several single-objective optimizations, insures rational interval between individuals and avoids premature convergence. Crossover and mutation operator are adjusted according to the fitness and iterative degree. Thus, each individual owns the ability of self-adaptation with the variation of environment. The simulated results verified the effectiveness of AGA.
Enhancing privacy in identity management systems
Authors: Steven Gevers, Verslype Verslype, Bart De Decker
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

User-privacy in existing identity management systems (IMS) can be improved.Indeed, private credential systems offer privacy enhancing capabilities not yet included in current IMS; e.g. proving claims such as age > 18, with age an attribute. This paper introduces privacy enhanced claim URIs which enable to request personal data in a privacy friendly way. We show how many private credential capabilities can be achieved in current IMS without using private credentials and continue by showing how these URIs allow integration of private credential systems in Microsoft Cardspace. Since our approach is very simple and widely applicable, it allows to enhance privacy friendliness of today's online transactions.
A Restructurable Computer System
Authors: S. S. Reddi
Venue: IEEE Transactions on Computers (1978)

This paper presents an architecture for a restructurable computer system which reconfigures its resources according to the problem environment for efficient performance. It converts the user's program into an intermediate level language called Realist which is capable of specifying arbitrary resource structures such as an array or a pipeline and the computation to be performed upon these structures. An architectural design for the system is presented with special attention to bus units. It is shown how APL, a vector processing language, can be implemented on the system. Some storage schemes are considered for organizing vectors and matrices to facilitate efficient retrieval and manipulation. The paper is concluded with a comparison of the proposed system to existing high speed architectures.
State Minimization of Incompletely Specified Sequential Machines
Authors: J. Kella
Venue: IEEE Transactions on Computers (1970)

This paper describes a new method for the state minimization of incompletely specified sequential machines. Previously described methods start with generating all maximal compatibles of states of the original incompletely specified machine and then try to find a closed cover which consists of a minimal number of MCs or portions of MCs. This process involves a long enumeration process and, as the number of states grows, turns out to be impractical for hand calculation.
The inaccurate conception
Authors: Phillip G. Armour
Venue: Communications of the ACM (2008)

Some thoughts on the accuracy of estimates.
Device-circuit co-optimization for mixed-mode circuit design via geometric programming
Authors: Jintae Kim, Ritesh Jhaveri, Jason Woo, Chih-Kong Ken Yang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Modern processing technologies offer a number of types of devices such as high-VT, low-VT, thick-oxide, etc. in addition to the nominal transistor in order to meet system performance and functional needs. While designers have leveraged these devices for mixed-signal design, a design framework is needed to guide designers in selecting the best set of devices. The same framework can enable device manufacturers decide which new devices to include in the suite of device offerings. This paper presents a design methodology that can quickly guide a designer in selecting the best set of devices for a given application, specifications, and circuit structure. The equation-based optimization framework based on geometric programming (GP) extends upon previous efforts that optimize sizing, biasing, and supply voltages. The paper first shows that convex piecewise-linear function fitting can effectively model for optimization all the types of devices offered by a 90nm CMOS technology. Additionally, we show the potential to model and include experimental devices such as a Schottky Tunneling Source MOSFET. Second, the paper applies the model to an example circuit, a track-and-hold amplifier. The optimization and subsequent simulation illustrate the importance and amount of benefit from applying device selection.
A smart room for hospitalised elderly people: essay of modelling and first steps of an experiment
Authors: Vincent Rialle, Nancy Lauvernay, Alain Franco, Jean-François Piquard, Pascal Couturier
Venue: Technology and Health Care (1999)

We present a study of modelling and the first steps of an experiment of a smart room for hospitalised elderly people. The system aims at detecting falls and sicknesses, and implements four main functions: perception of patient and environment through sensors, reasoning from perceived events and patient clinical findings, action by way of alarm triggering and message passing to medical staff, and adaptation to various patient profiles, sensor layouts, house fixtures and architecture. It includes a physical multisensory device located in the patients room, and a multi-agent system for fall detection and alarm triggering. This system encompasses a perception agent, and a reasoning agent. The latter has two complementary capacities implemented by sub-agents: deduction of type of alarm from incoming events, and knowledge induction from recorded events. The system has been tested with a few patients in real clinical situation, and the first experiment provides encouraging results which are described in a precise manner.
Research on the Fusion Methods with High Information Preservation
Authors: Wenbo Li, Qiuwen Zhang, Yongchuan Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Modified Brovey transform (MBT) based on the principle of Brovey transform (BT) has been proposed in this paper to merge each band of remotely sensed imagery. Three information fusion methods, wavelet transform, smoothing filter-based intensity modulation (SFIM), and MBT have been employed to merge the multi-spectral images with panchromatic image of IKONOS sensor. The visual evaluation and quantitative analysis confirm that MBT has the highest spatial frequency information preservation while SFIM enjoys the best preservation of spectral information, and comparatively, wavelet transform has a suboptimal spectral maintenance and the lowest high spatial frequency gain of those three algorithms.
Three Dimensional Broadcast Protocol forWireless Networks
Authors: Vamsi Paruchuri, Arjan Durresi, Leonard Barolli, Makoto Takizawa
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

We present Three Dimensional Broadcast (3DB) a wireless protocol designed for communication among nodes in three dimensional space. 3DB can be used for a large variety of applications, with static or mobile nodes. However, in this paper we apply 3DB for communications among airplanes, to show that the protocol performs very good even in such difficult conditions. On the other hand, communications among aeroplanes is an important application. In this scenario, 3DB enables the broadcast of emergency and surveillance information such as real time video over the network even in presence of adverse conditions, such as coordinated terrorist attacks, which might have disrupted other communication ways. 3DB is very robust. 3DB minimizes the number of retransmissions and therefore reduce the collisions, which could considerably delay transmissions and disrupt the communications during emergency situations. 3DB performs very well in highly dynamic ad hoc networks of airplane. We have evaluated 3DB through analysis and ns-2 simulations.