Earticle

Three general algorithms for evaluating the reliability for complex bridge system are proposed. These methods, such as Keystone, Boolean, Network algorithms are powerful and effective to derive an reliability expression for many practical complex systems. The combination approach of RBD and FTA proposed in this paper provides an effective way to evaluate the functional dependency for applications of FMEA.

Recently, as Rapid Prototyping is attracting people's attention, many peoples are actively participating in the research on STL format. The STL files are transformed to be input for RP after modeling in CAD system. When the shape, however, needs to be changed or edited, it is impossible without the original data. So, if the original data is lost, new modeling is required. Therefore, this study suggests a way to edit the shape in STL format and to make the Boolean operation possible between the original and edited shapes. In addition, the reliability was confirmed after going over the errors of the edited data.

The requirements of multi-resolution models of feature-based solids, which represent an object at many levels of feature detail, are increasing for engineering purposes, such as analysis, network-based collaborative design, virtual prototyping and manufacturing. To provide multi-resolution models for various applications, it is essential to generate adequate solid models at varying levels of detail (LOD) after feature rearrangement, based on the LOD criteria. However, the non-commutative property of the union and subtraction Boolean operations is a severe obstacle to arbitrary feature rearrangement. To solve this problem we propose history-based Boolean operations that satisfy the commutative law between union and subtraction operations by considering the history of the Boolean operations. Because these operations guarantee the same resulting shape as the original and reasonable shapes at the intermediate LODs for an arbitrary rearrangement of its features, various LOD criteria can be applied for multi-resolution modeling in different applications.

Visual saliency detection is an essential task because it is an important part of various vision-based applications. There are many techniques for saliency detection in color images. However, the number of methods for saliency detection in infrared images is limited. In this paper, we introduce a simple approach for saliency detection in infrared images based on the thresholding technique. The input image is thresholded into several Boolean maps, and an initial saliency map is calculated as a weighted sum of the created Boolean maps. The initial map is further refined by using thresholding, morphology operation, and a Gaussian filter to produce the final, high-quality saliency map. The experiment showed that the proposed method has high performance when applied to real-life data.

A cause-effect graph considers only the desired external behavior of a system by identifying input-output parameter relationships in the specification. When testing a software system with cause-effect graphs, it is important to derive a moderate number of tests while avoiding loss in fault detection ability. Pairwise testing is known to be effective in determining errors while considering only a small portion of the input space. In this paper, we present a new testing technique that generates pairwise tests from a cause-effect graph. We use a Boolean Satisbiability (SAT) solver to generate pairwise tests from a cause-effect graph. The Alloy language is used for encoding the cause-effect graphs and its SAT solver is applied to generate the pairwise tests. Using a SAT solver allows us to effectively manage constraints over the input parameters and facilitates the generation of pairwise tests, even in the situations where other techniques fail to satisfy full pairwise coverage.

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.

우리나라 도시계획 제도의 근간인 용도지역제는 건축자유를 기본원칙으로 하되, 공공복리를 위하여 이 자유를 일정수준 제한하는 제도이다. 따라서 용도지정은 명확한 기준에 근거하여 논리적 오류없이 지정되고, 예외는 누구나 동의할 수 있는 일부 불가피한 사례에만 적용되어야만 형평성을 인정받을 수 있다. 그러나 용도지정이 일정한 논리적 근거를 따르더라도 이를 객관적으로 검증함으로써 용도지정의 객관성과 신뢰성을 제고할 방법이 도출되지 못한 실정이다. 이에 본 연구에서는 위 문제를 해소하기 위한 하나의 방법으로서, 일종의 논리연산인 부울연산을 활용하여 용도지정의 논리적 정합성을 검토하는 방안을 제안하고자 한다. 이를 검토하고자 제주특별자치도의 관리지역 세분사례를 중심으로 도시관리계획 상 관리지역 세분 기준을 형식논리로 전개하고 GIS 상의 부울연산 기법을 활용하여 논리연산도구를 제작하였다. 이를 수행한 결과 관리지역 세분의 논리적 정합성, 논리적 오류의 원인, 그리고 그 정책적 시사점을 도출할 수 있었다.

The zoning regulation is provided to restrict the private land-use activities to a certain degree in an effort to augment the level of public interest and welfare. It thus should be based on the principles that are logically clear and consistent and are free from any defect so as to be objectively agreeable by the majority of the constituents to guarantee the societal equity. The current Korean zoning consequences, however, have been criticized by many for its lack of proper procedures and effective tools to check their qualification in terms of the aforementioned conditions despite the legally dictated statements as well as advanced spatial analysis tools. By taking Jeju Island, the globally renowned resort island of Korea, as the case area, this study tries to evaluate the methodology to check the appropriateness of the current zoning outcomes in the island on the GIS platform by using the Boolean operations.

Sphere-packing problem은 주어진 공간에 가능한 한 많은 구(sphere)를 채울 수 있는 배열을 찾는 문제이고 covering problem은 이에 쌍대적인 최적화의 문제로 코딩이론에 적용된다. 본 논문에서는 이진 코드이론에서의 가중치(weight)와 해밍거리(Hamming distance)에 대한 개념을 부울 대수(Boolean algebra)의 개념으로 일반화한다. 부울 대수에서의 가중치와 이를 이용하여 거리함수를 정의하고, 이들의 기본적인 성질들을 밝힌다. 또한, 부울 대수에서의 sphere-packing bound와 Gilbert-Varshamov bound의 정리를 증명한다.

A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.

게임은 점차 복잡해짐에 따라 게임 환경(맵)도 복잡해지고 있다. 게임 환경(맵)이 복잡해지면 게임 신뢰성을 입증하기 위해서 많은 테스트 프로세스와 방법이 복잡해지는 경향이 있다. 본 논문에서는 자동 생성되는 게임 환경(맵)을 정확하게 진행하는지를 검증하고, 테스트를 줄일 수 있는 테스팅 기법을 AND/OR 그래프와 불식(boolen expression)을 이용하여 제안한다.

As games become ever more complex, game environments (map) are becoming increasingly complex. In this paper, I propose a method to verify the validity of the progression of the automatic map generation as it is being processed. The method It also is proposed to simplify and shorten verification test process using AND/OR graph and Boolean expressions.

This As to the research on AspectJ in this context, after analyzing the Java program, AspectJ can realize the capture of the join points based on the Boolean or Compound expression and Process-Control in the Java program. The information includes: the time to judge the runtime condition of each join point as “true”; use of the logic AND (&&) to combine pointcuts; and use of the logic OR (||) to combine pointcuts; declaration of anonymous pointcut and reuse of pointcut;It also includes all join points from beginning in program control-flow and those in which initial one is not included.

Context-awareness is an important characteristic for smart home. Context-aware system reacts and adapts according to the changes in the domain environment. In this paper, we have presented a mathematical modeling used for a context-aware system based on Boolean control network with five nodes for smart home. This Boolean control network describes the relationship between the context elements (user, time, location, activity) and service states (morning call, normal, entertainment, sleeping, guarding). We expressed the dynamics of the state spaces by linear algebraic equation using semi-tensor product of matrices, which is effective to logical inference and control.

Cause-effect graphs can be used for specifying safety critical systems including avionics control software that are often intended to satisfy Boolean expression. Using cause-effect graphs for requirements-based testing demands the ability of dealing with various constraints in cause-effect graphs. Due to its rapid advance, Boolean Satisfiability (SAT) solving seems to be a promising approach for constraint handling. In this paper, we present three approaches using SAT solving for pairwise test generation from cause-effect graphs. One is an ideal approach that tries to obtain a minimal set of tests. Another approach focuses on breaking the problem to smaller solvable problems to scale the applicability of SAT solving. The other makes full use of a partial instance that forms a part of a solution known priori. We compare the three approaches in terms of the number of generated pairwise tests and fault detection capability. Comparison results show that an approach using partial instances can generate less number of pairwise tests than the other two approaches without degrading fault detection capability.

The reason for the trend in high-level large-area photomasks is that mask size is becoming larger and the line size and gap design is becoming thinner. In addition, the uniformity requirements for producing photomasks are becoming stricter. Consequently, the difficulties faced in manufacturing photomasks have substantially increased and a particular graphic process is required to assist with improving the yield of photomask production. During the etching process of mask production, a non-uniform etching rate produces an inferior uniformity of the critical dimensions. The reasons for the inferior etching rate results include the uniformity of the photomask pattern, the spin speed of the etching machine, and the nozzle of the etching arms. This research focuses on the photomask pattern line-width compensation for improving uniformity and precision. The research combines logical operations to select the patterns that are necessary for special compensation, adding the appropriate compensation value to the pattern and combining it with the original pattern to generate a complete photomask pattern to compensate for the inferior etching rate that produces inferior line-width uniformity.

Smart home is a nondeterministic complex environment. Sensors and actuators network are involved in smart home to collect environmental information and to control the devices used by the user for comfort of life. Generally smart home system is implemented by logical rules which described the relation between each element (sensors and actuators). Controlling using logical rules is difficult. In this paper, we have represented an intelligent system for smart home by using Boolean Control Network. For easy control, we have used matrix expression of logic. The system is controlled in several states and in each state different device is operated through actuator network. Matlab based simulation work is done to show the state changes of the system. The result shows that using matrix expression it is easy to control the state of this system.

In this paper, we investigate the constructions of generalized bent Boolean functions defined on with values in Z4. We first present a construction of generalized bent Boolean functions defined on with values in Z4. The main technique is to utilize bent functions to derive generalized bent functions on odd number of variables. In addition, by using Boolean permutations, we provide a specific method to construct generalized bent functions on odd number of variables.

The problem of two-block disjoint decomposition of completely specified Boolean functions is considered. Recently a good method in functional decomposition category was proposed. This method is based on using the ternary matrix cover approach. Due to investigation and analysis of this method and to search for an appropriate partition, a computer program was developed. After running the program on thousands of systems of Boolean functions, experimental results show that more than 95% of the inspected systems are decomposable. To obtain a solution of the task in decomposable systems, an efficient technique is also proposed. Using this technique, investigation of one partition was enough to determine decomposability of the inspected systems.

Algebraic immunity is a cryptographic criterion for Boolean functions used in cryptosystem to resist algebraic attacks. They usually should have high algebraic immunity. Chen proposed a first order recursive construction of Boolean functions and checked that they had optimum algebraic immunity for n<8.This paper gives a detail proof of having optimum algebraic and being balanced for all n>0.

The rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used as components of different cryptosystems. In order to resist algebraic attacks, Boolean functions should have high algebraic immunity. This paper studies the construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity. We construct ( n/4 - 3) different rotation symmetric Boolean functions which achieve both optimum algebraic immunity and high nonlinearity when an even (n ≥ 16) is given.

Since information systems for providing only Boolean search do not provide prioritized search result, users have to carry out time-consuming checking for lots of results one by one. The method proposed in this study is to provide search result prioritized by using coupling information between tags instead of index weight information in Boolean search. Since document queries are used instead of general user queries, key tags to be used as queries in a relevant document are extracted. A variety of groups of Boolean queries depending on tag couplings are created in the process of creating queries, and prioritization is processed by means of differentiation information between relevant query groups, and tag significance information in the process of matching. The proposed method was applied to the process of finding related trend analysis information for the emerging technology information consisting of 1500 technologies to prove the usability of the proposed method.