Search results for: Problem solving courts

Authors: Gholamreza Ghodrati Amiri, Mojtaba Jafarian Abyaneh, Ali Zare Hosseinzadeh

Abstract:

This paper presents an effective model updating strategy for damage localization and quantification in frames by defining damage detection problem as an optimization issue. A generalized version of the Modal Residual Force (MRF) is employed for presenting a new damage-sensitive cost function. Then, Grey Wolf Optimization (GWO) algorithm is utilized for solving suggested inverse problem and the global extremums are reported as damage detection results. The applicability of the presented method is investigated by studying different damage patterns on the benchmark problem of the IASC-ASCE, as well as a planar shear frame structure. The obtained results emphasize good performance of the method not only in free-noise cases, but also when the input data are contaminated with different levels of noises.

Keywords: frame, grey wolf optimization algorithm, modal residual force, structural damage detection

Procedia PDF Downloads 361

Authors: Jahnu Bharadwaj

Abstract:

In the third decade of the 19th century, the political landscape of the Brahmaputra valley changed at many levels. The establishment of East India Company’s authority in ‘Assam’ was complete with the Treaty of Yandaboo. The whole phenomenon of the annexation of Assam into the British Indian Empire led to several administrative reorganizations and reforms under the new regime. British colonial rule was distinguished by new systems and institutions of governance. This paper broadly looks at the historical proceedings of the introduction of the Rule of Law and a new legal structure in the region of ‘Assam’. With numerous archival data, this paper seeks to chiefly examine the trajectory of an important element in the new legal apparatus, i.e. the jury in the British criminal courts introduced in the newly annexed region. Right from the beginning of colonial legal innovations with the establishment of the panchayats and the parallel courts in Assam, the jury became an important element in the structure of the judicial system. In both civil and criminal courts, the jury was to be formed from the learned members of the ‘native’ society. In the working of the criminal court, the jury became significantly powerful and influential. The structure meant that the judge or the British authority eventually had no compulsion to obey the verdict of the jury. However, the structure also provided that the jury had a considerable say in matters of the court proceedings, and their verdict had significant weight. This study seeks to look at certain important criminal cases pertaining to the nineteenth century and the functioning of the jury in those cases. The power play at display between the British officials, judges and the members of the jury would be helpful in highlighting the important deliberations and politics that were in place in the functioning of the British criminal legal apparatus in colonial Assam. The working and the politics of the members of the jury in many cases exerted considerable influence in the court proceedings. The interesting negotiations of the British officials or judges also present us with vital insights. By reflecting on the difficulty that the British officials and judges felt with the considerable space for opinion and difference that was provided to important members of the local society, this paper seeks to locate, with evidence, the racial politics at play within the official formulations of the legal apparatus in the colonial rule in Assam. This study seeks to argue that despite the rhetorical claims of legal equality within the Empire, racial consideration and racial politics was a reality even in the making of the structure itself. This in a way helps to enrich our ideas about the racial elements at work in numerous layers sustaining the colonial regime.

Keywords: criminal courts, colonial regime, jury, race

Procedia PDF Downloads 156

Authors: Sung Ryong Kim, Hyung Sup Han, Jae-Yup Kim

Abstract:

Many engineering students feel uncomfortable in solving the industry related problems. There are many ways to strengthen the engineering student’s ability to solve the assigned problem when they get a job. Korea National University of Transportation has developed an industry-oriented undergraduate research program (URP). An URP program is designed for engineering students to provide an experience of solving a company’s research problem. The URP project is carried out for 6 months. Each URP team consisted of 1 company mentor, 1 professor, and 3-4 engineering students. A team of different majors is strongly encouraged to integrate different perspectives of multidisciplinary background. The corporate research projects proposed by companies are chosen by the major-related student teams. A company mentor gives the detailed technical background of the project to the students, and he/she also provides a basic data, raw materials and so forth. The company allows students to use the company's research equipment. An assigned professor has adjusted the project scope and level to the student’s ability after discussing with a company mentor. Monthly meeting is used to check the progress, to exchange ideas, and to help the students. It is proven as an effective engineering education program not only to provide an experience of company research but also to motivate the students in their course work. This program provides a premier interdisciplinary platform for undergraduate students to perform the practical challenges encountered in their major-related companies and it is especially helpful for students who want to get a job from a company that proposed the project.

Keywords: company mentor, industry oriented, interdisciplinary platform, undergraduate research program

Procedia PDF Downloads 225

Authors: Mitat Uysal

Abstract:

A new met heuristic optimization algorithm called as Migrating Birds Optimization is used for curve fitting by rational cubic Bezier Curves. This requires solving a complicated multivariate optimization problem. In this study, the solution of this optimization problem is achieved by Migrating Birds Optimization algorithm that is a powerful met heuristic nature-inspired algorithm well appropriate for optimization. The results of this study show that the proposed method performs very well and being able to fit the data points to cubic Bezier Curves with a high degree of accuracy.

Keywords: algorithms, Bezier curves, heuristic optimization, migrating birds optimization

Procedia PDF Downloads 313

Authors: M. G. N. A. S. Fernando

Abstract:

This study uses a researchable framework to improve the quality of ICT education and the Teaching Learning Assessment/ Evaluation (TLA/TLE) process. It utilizes existing resources while improving the methodologies along with pedagogical techniques and e-Learning approaches used in the secondary schools of Sri Lanka. The study was carried out in two phases. Phase I focused on investigating the factors which affect the quality of ICT education. Based on the key factors of phase I, the Phase II focused on the design of an Experimental Application Model with 6 activity levels. Each Level in the Activity Model covers one or more levels in the Revised Bloom’s Taxonomy. Towards further enhancement of activity levels, other pedagogical techniques (activity based learning, e-learning techniques, problem solving activities and peer discussions etc.) were incorporated to each level in the activity model as appropriate. The application model was validated by a panel of teachers including a domain expert and was tested in the school environment too. The validity of performance was proved using 6 hypotheses testing and other methodologies. The analysis shows that student performance with problem solving activities increased by 19.5% due to the different treatment levels used. Compared to existing process it was also proved that the embedded techniques (mixture of traditional and modern pedagogical methods and their applications) are more effective with skills development of teachers and students.

Keywords: activity models, Bloom’s taxonomy, ICT education, pedagogies

Procedia PDF Downloads 139

Authors: Sergey Kopysov, Nikita Nedozhogin, Leonid Tonkov

Abstract:

The article presents a parallel iterative solver for large sparse linear systems which can be used on a heterogeneous platform. Traditionally, the problem of solving linear systems does not scale well on multi-CPU/multi-GPUs clusters. For example, most of the attempts to implement the classical conjugate gradient method were at best counted in the same amount of time as the problem was enlarged. The paper proposes the pipelined variant of the conjugate gradient method (PCG), a formulation that is potentially better suited for hybrid CPU/GPU computing since it requires only one synchronization point per one iteration instead of two for standard CG. The standard and pipelined CG methods need the vector entries generated by the current GPU and other GPUs for matrix-vector products. So the communication between GPUs becomes a major performance bottleneck on multi GPU cluster. The article presents an approach to minimize the communications between parallel parts of algorithms. Additionally, computation and communication can be overlapped to reduce the impact of data exchange. Using the pipelined version of the CG method with one synchronization point, the possibility of asynchronous calculations and communications, load balancing between the CPU and GPU for solving the large linear systems allows for scalability. The algorithm is implemented with the combined use of technologies: MPI, OpenMP, and CUDA. We show that almost optimum speed up on 8-CPU/2GPU may be reached (relatively to a one GPU execution). The parallelized solver achieves a speedup of up to 5.49 times on 16 NVIDIA Tesla GPUs, as compared to one GPU.

Keywords: conjugate gradient, GPU, parallel programming, pipelined algorithm

Procedia PDF Downloads 136

Authors: Jason Digalakis, John Cotronis

Abstract:

Memetic algorithms (MAs) are useful for solving optimization problems. It is quite difficult to search the search space of the optimization problem with large dimensions. There is a challenge to use all the cores of the system. In this study, a sequential implementation of the memetic algorithm is converted into a concurrent version, which is executed on the cores of both CPU and GPU. For this reason, CUDA and OpenMP libraries are operated on the parallel algorithm to make a concurrent execution on CPU and GPU, respectively. The aim of this study is to compare CPU and GPU implementation of the memetic algorithm. For this purpose, fourteen benchmark functions are selected as test problems. The obtained results indicate that our approach leads to speedups up to five thousand times higher compared to one CPU thread while maintaining a reasonable results quality. This clearly shows that GPUs have the potential to acceleration of MAs and allow them to solve much more complex tasks.

Keywords: memetic algorithm, CUDA, GPU-based memetic algorithm, open multi processing, multimodal functions, unimodal functions, non-linear optimization problems

Procedia PDF Downloads 64

Authors: Chung To Kong, Siu Ming Yiu

Abstract:

Rubik's cube was invented in 1974. Since then, speedcubers all over the world try their best to break the world record again and again. The newest record is 3.47 seconds. There are many factors that affect the timing, including turns per second (tps), algorithm, finger trick, hardware of the cube. In this paper, the lower bound of the cube solving time will be discussed using convex optimization. Extended analysis of the world records will be used to understand how to improve the timing. With the understanding of each part of the solving step, the paper suggests a list of speed improvement techniques. Based on the analysis of the world record, there is a high possibility that the 3 seconds mark will be broken soon.

Keywords: Rubik's Cube, speed, finger trick, optimization

Procedia PDF Downloads 183

Authors: Oscar Sang, Shadrack David Rotich

Abstract:

Parliamentary immunity is grounded on the notion that parliaments need certain rights or immunities to ensure they can operate independently make fair and impartial decisions without capitulating to political pressure or intimidation. The 2013 election in Kenya marked an important milestone in the development of the law of parliamentary privilege. Such importance relates to the dramatic increase in the number of legislatures in the country from one unicameral parliament, to a bicameral national parliament and forty-seven other regional legislative assemblies. The increase in legislatures has resulted in a dramatic increase in political contestations which have led to legal wrangles. The judiciary in Kenya, once considered submissive, has been invited to arbitrate on various matters pitting individual rights and parliamentary privilege and have invalidated a number of legislative action. While judicial intervention is indeed necessary to ensure that legislatures in Kenya live true to the constitutional aspirations of the Kenyan people, certain judicial decisions have had an effect on eroding parliamentary immunity. This paper highlights a number of instances in which it could be argued that parliamentary privilege came under attack by the courts in Kenya. The paper aims to make a case that while Kenya’s progressive constitution necessitates the scope and extent of legislature’s immunities and privilege to be determined by the courts, it is important that courts exercise restraint in its review of legislative action. The paper makes the argument that unrestrained judicial action in Kenya on questions within the realm parliamentary privilege may undermine the functioning of Kenya’s legislatures. The paper explores approaches taken by a number of jurisdictions in establishing a proper balance between maintaining a viable parliamentary privilege regime in a rights-based constitutional system.

Keywords: Kenya, constitution, judicial restraint, parliamentary privilege

Procedia PDF Downloads 141

Authors: Aline F. C. Pereira

Abstract:

In recent years, modern slavery has increasingly gathered attention in scholarly discussions and policy debates. Whereas the mainstream studies focus on forced labour and trafficking, little attention is paid to other forms of exploitation, such as degrading conditions of work –criminalised in Brazil as an autonomous type of slavery since 2003. This paper aims to bridge this gap. It adopts a mixed method that comprises both qualitative and quantitative analysis, to investigate the adjudication of 164 cases of degrading conditions of work by Brazilian labour courts. The research discloses an ungrounded reluctance to apply the domestic legal framework, as in most of the cases degrading conditions of work are not recognised as contemporary slavery, despite the law. In some cases, not even situations described as subhuman and degrading of human dignity were framed as slavery. The analysis also suggests that, as in chattel times, lack of freedom and subjection remain relevant in the legal characterisation of slave labour. The examination has further unraveled a phenomenon absent in previous studies: normalisation of precarity. By depicting precarity as natural and inevitable in rural areas, labour courts ensure conformity to the status quo and reduce the likelihood of resistance by victims. Moreover, compensations afforded to urban workers are higher than granted to rural employees, which seems to place human beings in hierarchical categories -a trace of colonialism. In sum, the findings challenge the worldwide spread assumption that Brazil addresses slavery efficiently. Conversely, the Brazilian Labour Judiciary seems to remain subservient to a colonial perspective of slavery, legitimising, and sanctioning abusive practices.

Keywords: adjudication, contemporary slavery, degrading conditions of work, normalisation of precarity

Procedia PDF Downloads 93

Authors: Salami Akeem Olanrewaju

Abstract:

The transportation models or problems are primarily concerned with the optimal (best possible) way in which a product produced at different factories or plants (called supply origins) can be transported to a number of warehouses or customers (called demand destinations). The objective in a transportation problem is to fully satisfy the destination requirements within the operating production capacity constraints at the minimum possible cost. The objective of this study is to determine ways of minimizing transport cost in order to maximum profit. Data were gathered from the records of the Distribution Department of 7-Up Bottling Company Plc. Ilorin, Kwara State, Nigeria. The data were analyzed using SPSS (Statistical Package for Social Sciences) while applying the three methods of solving a transportation problem. The three methods produced the same results; therefore, any of the method can be adopted by the company in transporting its final products to the wholesale dealers in order to minimize total production cost.

Keywords: cost minimization, resources utilization, distribution system, allocation problem

Procedia PDF Downloads 233

Authors: Chonlawit Yuwajitaa, Suttipong Pruangkab

Abstract:

Existing situation on labour use, health management and problems, and ancillary work done along with buffalo farming in Thailand was studied, There were 52 farms had been interviewed during August to September 2014. The study revealed that 100 percent of labor use was family labors themselves and all of farmers reared their buffaloes and grew rice simultaneously. The farmers valued veterinary service and advice as the most important problem (40.40%) and buffalo farming health problems was found 7.69% of dystocia, retain placenta and abortion. The major problem that should be taken into account was officials involved and buffalo farming should be continually promoted by government sectors to help solving economic problems as a whole.

Keywords: buffalo, labor use, health management, Thailand

Procedia PDF Downloads 438

Authors: José de Jesús Rivero Oliva, Jesús Salomón Llanes, Manuel Perdomo Ojeda, Antonio Torres Valle

Abstract:

Combinatorial explosion is a common problem to both predominant methods for solving fault trees: Minimal Cut Set (MCS) approach and Binary Decision Diagram (BDD). High memory consumption impedes the complete solution of very complex fault trees. Only approximated non-conservative solutions are possible in these cases using truncation or other simplification techniques. The paper proposes a method (CSolv+) for solving complex fault trees, without any possibility of combinatorial explosion. Each individual MCS is immediately discarded after its contribution to the basic events importance measures and the Top gate Upper Bound Probability (TUBP) has been accounted. An estimation of the Top gate Exact Probability (TEP) is also provided. Therefore, running in a computer cluster, CSolv+ will guarantee the complete solution of complex fault trees. It was successfully applied to 40 fault trees from the Aralia fault trees database, performing the evaluation of the top gate probability, the 1000 Significant MCSs (SMCS), and the Fussell-Vesely, RRW and RAW importance measures for all basic events. The high complexity fault tree nus9601 was solved with truncation probabilities from 10-²¹ to 10-²⁷ just to limit the execution time. The solution corresponding to 10-²⁷ evaluated 3.530.592.796 MCSs in 3 hours and 15 minutes.

Keywords: system reliability analysis, probabilistic risk assessment, fault tree analysis, basic events importance measures

Procedia PDF Downloads 14

Authors: Irina Maria Artinescu, Costin Radu Boldea, Eduard-Ionut Matei

Abstract:

The paper is a comparative study of two classical variants of parallel projection methods for solving the convex feasibility problem with their equivalents that involve variable weights in the construction of the solutions. We used a graphical representation of these methods for inpainting a convex area of an image in order to investigate their effectiveness in image reconstruction applications. We also presented a numerical analysis of the convergence of these four algorithms in terms of the average number of steps and execution time in classical CPU and, alternatively, in parallel GPU implementation.

Keywords: convex feasibility problem, convergence analysis, inpainting, parallel projection methods

Procedia PDF Downloads 150

Authors: Alexander P. Smirnov, Sergey A. Matveev, Dmitry A. Zheltkov, Eugene E. Tyrtyshnikov

Abstract:

We propose a new computational technique for multidimensional (multicomponent) Smoluchowski coagulation equation. Using low-rank approximations in Tensor Train format of both the solution and the coagulation kernel, we accelerate the classical finite-difference Runge-Kutta scheme keeping its level of accuracy. The complexity of the taken finite-difference scheme is reduced from O(N^2d) to O(d^2 N log N ), where N is the number of grid nodes and d is a dimensionality of the problem. The efficiency and the accuracy of the new method are demonstrated on concrete problem with known analytical solution.

Keywords: tensor train decomposition, multicomponent Smoluchowski equation, runge-kutta scheme, convolution

Procedia PDF Downloads 410

Authors: M. Barsa

Abstract:

This paper argues that current jurisprudence under the Dormant Commerce Clause of the United States Constitution and the WTO should be altered to allow states to more freely foster clean energy production. In particular, free trade regimes typically prevent states from discriminating against 'like' products, and whether these products are considered 'like' is typically measured by how they appear to the consumer. This makes it challenging for states to discriminate in favor of clean energy, such as low-carbon fuels. However, this paper points out that certain courts in the US—and decisions of the WTO—have already begun taking into account how a product is manufactured in order to determine whether a state may discriminate against it. There are also compelling reasons for states to discriminate against energy sources with high carbon footprints in order to allow those states to protect themselves against climate change. In other words, fuel sources with high and low carbon footprints are not, in fact, 'like' products, and courts should more freely recognize this in order to foster clean energy production.

Keywords: clean energy, climate change, discrimination, free trade

Procedia PDF Downloads 107

Authors: Leizhang Wang, Baocang Wang

Abstract:

General Sieve Kernel (G6K) is considered as currently the fastest algorithm for the shortest vector problem (SVP) and record holder of open SVP challenge. We study the lattice basis quality improvement effects of the Workout proposed in G6K, which is composed of a series of pumps to solve SVP. Firstly, we use a low-dimensional pump output basis to propose a predictor to predict the quality of high-dimensional Pumps output basis. Both theoretical analysis and experimental tests are performed to illustrate that it is more computationally expensive to solve the LWE problems by using a G6K default SVP solving strategy (Workout) than these lattice reduction algorithms (e.g. BKZ 2.0, Progressive BKZ, Pump, and Jump BKZ) with sieving as their SVP oracle. Secondly, the default Workout in G6K is optimized to achieve a stronger reduction and lower computational cost. Thirdly, we combine the optimized Workout and the Pump output basis quality predictor to further reduce the computational cost by optimizing LWE instances selection strategy. In fact, we can solve the TU LWE challenge (n = 65, q = 4225, = 0:005) 13.6 times faster than the G6K default Workout. Fourthly, we consider a combined two-stage (Preprocessing by BKZ- and a big Pump) LWE solving strategy. Both stages use dimension for free technology to give new theoretical security estimations of several LWE-based cryptographic schemes. The security estimations show that the securities of these schemes with the conservative Newhope’s core-SVP model are somewhat overestimated. In addition, in the case of LAC scheme, LWE instances selection strategy can be optimized to further improve the LWE-solving efficiency even by 15% and 57%. Finally, some experiments are implemented to examine the effects of our strategies on the Normal Form LWE problems, and the results demonstrate that the combined strategy is four times faster than that of Newhope.

Keywords: LWE, G6K, pump estimator, LWE instances selection strategy, dimension for free

Procedia PDF Downloads 43

Authors: Ferzat Anka

Abstract:

Many types of problems can be solved using traditional analytical methods. However, these methods take a long time and cause inefficient use of resources. In particular, different approaches may be required in solving complex and global engineering problems that we frequently encounter in real life. The bigger and more complex a problem, the harder it is to solve. Such problems are called Nondeterministic Polynomial time (NP-hard) in the literature. The main reasons for recommending different metaheuristic algorithms for various problems are the use of simple concepts, the use of simple mathematical equations and structures, the use of non-derivative mechanisms, the avoidance of local optima, and their fast convergence. They are also flexible, as they can be applied to different problems without very specific modifications. Thanks to these features, it can be easily embedded even in many hardware devices. Accordingly, this approach can also be used in trend application areas such as IoT, big data, and parallel structures. Indeed, the metaheuristic approaches are algorithms that return near-optimal results for solving large-scale optimization problems. This study is focused on the new metaheuristic method that has been merged with the chaotic approach. It is based on the chaos theorem and helps relevant algorithms to improve the diversity of the population and fast convergence. This approach is based on Chimp Optimization Algorithm (ChOA), that is a recently introduced metaheuristic algorithm inspired by nature. This algorithm identified four types of chimpanzee groups: attacker, barrier, chaser, and driver, and proposed a suitable mathematical model for them based on the various intelligence and sexual motivations of chimpanzees. However, this algorithm is not more successful in the convergence rate and escaping of the local optimum trap in solving high-dimensional problems. Although it and some of its variants use some strategies to overcome these problems, it is observed that it is not sufficient. Therefore, in this study, a newly expanded variant is described. In the algorithm called Ex-ChOA, hybrid models are proposed for position updates of search agents, and a dynamic switching mechanism is provided for transition phases. This flexible structure solves the slow convergence problem of ChOA and improves its accuracy in multidimensional problems. Therefore, it tries to achieve success in solving global, complex, and constrained problems. The main contribution of this study is 1) It improves the accuracy and solves the slow convergence problem of the ChOA. 2) It proposes new hybrid movement strategy models for position updates of search agents. 3) It provides success in solving global, complex, and constrained problems. 4) It provides a dynamic switching mechanism between phases. The performance of the Ex-ChOA algorithm is analyzed on a total of 8 benchmark functions, as well as a total of 2 classical and constrained engineering problems. The proposed algorithm is compared with the ChoA, and several well-known variants (Weighted-ChoA, Enhanced-ChoA) are used. In addition, an Improved algorithm from the Grey Wolf Optimizer (I-GWO) method is chosen for comparison since the working model is similar. The obtained results depict that the proposed algorithm performs better or equivalently to the compared algorithms.

Keywords: optimization, metaheuristic, chimp optimization algorithm, engineering constrained problems

Procedia PDF Downloads 56

Authors: Juanita Morris

Abstract:

The purpose of this study will examine the mediating relationships between the theories of intelligence, mathematics anxiety, gender stereotype threat, meta-cognition and math performance through the use of eye tracking technology, affecting student perception and problem-solving abilities. The participants will consist of (N=80) female graduate students. Test administered were the Abbreviated Math Anxiety Scale, Tobii Eye Tracking software, gender stereotype threat through Google images, and they will be asked to describe their problem-solving approach allowed to measure metacognition. Participants will be administered mathematics problems while having gender stereotype threat shown to them through online images while being directed to look at the eye tracking software Tobii. We will explore this by asking ‘Is mathematics anxiety associated with the theories of intelligence and gender stereotype threat and how does metacognition and math performance place a role in mediating those perspectives?’. It is hypothesized that math-anxious students are more likely affected by the gender stereotype threat and that may play a role in their performance? Furthermore, we also want to explore whether math anxious students are more likely to be an entity theorist than incremental theorist and whether those who are math anxious will be more likely to be fixated on variables associated with coefficients? Path analysis and independent samples t-test will be used to generate results for this study. We hope to conclude that both the theories of intelligence and metacognition mediate the relationship between mathematics anxiety and gender stereotype threat.

Keywords: math anxiety, emotions, affective domains fo learning, cognitive underlinings

Procedia PDF Downloads 248

Authors: Majid Khalili

Abstract:

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective variable neighborhood algorithm (MOVNS). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOVNS provides sound performance comparing with other algorithms.

Keywords: no-wait hybrid flowshop scheduling; multi-objective variable neighborhood algorithm; makespan; total weighted tardiness

Procedia PDF Downloads 400

Authors: Nivedha Rajaram

Abstract:

Hybrid Quantum solvers have been given prime focus in recent days by computation problem-solving domain industrial applications. D’Wave Quantum Computers are one such paragon of systems built using quantum annealing mechanism. Discrete Quadratic Models is a hybrid quantum computing model class supplied by D’Wave Ocean SDK - a real-time software platform for hybrid quantum solvers. These hybrid quantum computing modellers can be employed to solve classic problems. One such problem that we consider in this paper is finding a network connectivity knowledge hub in a huge network of systems. Using this quantum solver, we try to find out the prime system hub, which acts as a supreme connection point for the set of connected computers in a large network. This paper establishes an innovative problem approach to generate a connectivity system hub plot for a set of systems using DWave ocean SDK hybrid quantum solvers.

Keywords: quantum computing, hybrid quantum solver, DWave annealing, network knowledge graph

Procedia PDF Downloads 96

Authors: Homa Ghave, Parmis Shahmaleki

Abstract:

This paper presents a new multi-criteria stochastic mathematical model for a single machine scheduling with outsourcing allowed. There are multiple jobs processing in batch. For each batch, all of job or a quantity of it can be outsourced. The jobs have stochastic processing time and lead time and deterministic due dates arrive randomly. Because of the stochastic inherent of processing time and lead time, we use the chance constrained programming for modeling the problem. First, the problem is formulated in form of stochastic programming and then prepared in a form of deterministic mixed integer linear programming. The objectives are considered in the model to minimize the maximum tardiness and outsourcing cost simultaneously. Several procedures have been developed to deal with the multi-criteria problem. In this paper, we utilize the concept of satisfaction functions to increases the manager’s preference. The proposed approach is tested on instances where the random variables are normally distributed.

Keywords: single machine scheduling, multi-criteria mathematical model, outsourcing strategy, uncertain lead times and processing times, chance constrained programming, satisfaction function

Procedia PDF Downloads 242

Authors: Qusai Alshahwan

Abstract:

The arbitrator’s duties of independence and impartiality play a significant role in delivering arbitral awards which legitimate the fundamental of arbitration concepts. For this reason, the international and national arbitration rules require arbitrators to be independent and impartial to solve the arbitration disputes fairly between the parties. However, solving the disputes fairly also requires arbitrators to disclose any existing conflicts of interest with the parties to avoid misunderstanding and late challenges. In contrary with the international and national arbitration rules, the English Arbitration Act 1996 does not include independence as a separate ground for arbitrator’s removal, and importantly the English Arbitration Act 1996 is deliberately silent to the arbitrator duty of disclosure. The absence of arbitrator duty of disclosure is an issue had generated uncertainty and concerns for the arbitration community under the English jurisdiction, particularly when the English courts rejected the IBA guidelines of arbitrator conflict of interest such as in case of Halliburton v Chubb for example. This article is highlighting on the legal consequences of the absence of arbitrator duty of disclosure under the English Arbitration Act 1996 and the arbitrator's contractual obligations.

Keywords: arbitration, impartiality, independence, duty of disclosure, English Arbitration Act 1996

Procedia PDF Downloads 113

Authors: Craig A. Kaplan

Abstract:

If AGI proves to be a “winner-take-all” scenario where the first company or country to develop AGI dominates, then the first AGI must also be the safest. The safest, and fastest, path to Artificial General Intelligence (AGI) may be to harness the collective intelligence of multiple AI and human agents in an AGI network. This approach has roots in seminal ideas from four of the scientists who founded the field of Artificial Intelligence: Allen Newell, Marvin Minsky, Claude Shannon, and Herbert Simon. Extrapolating key insights from these founders of AI, and combining them with the work of modern researchers, results in a fast and safe path to AGI. The seminal ideas discussed are: 1) Society of Mind (Minsky), 2) Information Theory (Shannon), 3) Problem Solving Theory (Newell & Simon), and 4) Bounded Rationality (Simon). Society of Mind describes a collective intelligence approach that can be used with AI and human agents to create an AGI network. Information theory helps address the critical issue of how an AGI system will increase its intelligence over time. Problem Solving Theory provides a universal framework that AI and human agents can use to communicate efficiently, effectively, and safely. Bounded Rationality helps us better understand not only the capabilities of SuperIntelligent AGI but also how humans can remain relevant in a world where the intelligence of AGI vastly exceeds that of its human creators. Each key idea can be combined with recent work in the fields of Artificial Intelligence, Machine Learning, and Large Language Models to accelerate the development of a working, safe, AGI system.

Keywords: AI Agents, Collective Intelligence, Minsky, Newell, Shannon, Simon, AGI, AGI Safety

Procedia PDF Downloads 62

Authors: Hamioud Saida, Khalfallah Salah

Abstract:

In this study, a spectral element method is employed to predict the free vibration of a Euler-Bernoulli beam resting on a Winkler foundation with elastically restrained ends. The formulation of the dynamic stiffness matrix has been established by solving the differential equation of motion, which was transformed to frequency domain. Non-dimensional natural frequencies and shape modes are obtained by solving the partial differential equations, numerically. Numerical comparisons and examples are performed to show the effectiveness of the SEM and to investigate the effects of various parameters, such as the springs at the boundaries and the elastic foundation parameter on the vibration frequencies. The obtained results demonstrate that the present method can also be applied to solve the more general problem of the dynamic analysis of structures with higher order precision.

Keywords: elastically supported Euler-Bernoulli beam, free-vibration, spectral element method, Winkler foundation

Procedia PDF Downloads 113

Authors: Arlinda Memetaj

Abstract:

A sound system of administrative justice represents a vital element of democratic governance. The proper control of public administration consists not only of a sound civil service framework and legislative oversight, but empowerment of the public and courts to hold public officials accountable for their decision-making through the application of fair administrative procedural rules and the use of appropriate administrative appeals processes and judicial review. The establishment of effective public administration, has been since 1990s among the most 'important and urgent' final strategic objectives of the Republic of Macedonia. To this aim the country has so far adopted a huge series of legislative and strategic documents related to any aspects of the administrative justice system. The latter is designed to strengthen the legal position of citizens, businesses, civic organizations, and other societal subjects. 'Changes and reforms' in this field have been thus the most frequent terms being used in the country for the last more than 20 years. Several years ago the County established Administrative Courts, while permanently amending the Law on the General Administrative procedure (LGAP). The new LGAP was adopted in 2015 and it introduced considerable innovations concerned. The most recent inputs in this regard includes the National Public Administration Reform Strategy 2017 – 2022, one of the key expected result of which includes both providing effective protection of the citizens` rights. In doing the aforesaid however there is still a series of interrelated shortcomings in this regard, such as (just to mention few) the complex appeal procedure, delays in enforcing court rulings, etc. Against the above background, the paper firstly describes the Macedonian institutional and legislative framework in the above field, and then illustrates the shortcomings therein. It finally claims that the current status quo situation may be overcome only if there is a proper implementation of the administrative courts decisions and far stricter international monitoring process thereof. A new approach and strong political commitment from the highest political leadership is thus absolutely needed to ensure the principles of transparency, accountability and merit in public administration. The main method used in this paper is the descriptive, analytical and comparative one due to the very character of the paper itself.

Keywords: administrative justice, administrative procedure, administrative courts/disputes, European Human Rights Court, human rights, monitoring, reform, benefit.

Procedia PDF Downloads 131

Authors: Raphael Zanella

Abstract:

This works deals with the finite element approximation of axisymmetric problems. The weak formulation of the heat equation under the axisymmetry assumption is established for continuous finite elements. The weak formulation is implemented in a C++ solver with implicit march-in-time. The code is verified by space and time convergence tests using a manufactured solution. The solving of an example problem with an axisymmetric formulation is compared to that with a full-3D formulation. Both formulations lead to the same result, but the code based on the axisymmetric formulation is much faster due to the lower number of degrees of freedom. This confirms the correctness of our approach and the interest in using an axisymmetric formulation when it is possible.

Keywords: axisymmetric problem, continuous finite elements, heat equation, weak formulation

Procedia PDF Downloads 174

Authors: M. H. Yee, J. Md Yunos, W. Othman, R. Hassan, T. K. Tee, M. M. Mohamad

Abstract:

The generation of an idea that goes through several phases is affected by individual factors, interests, preferences and motivation. The purpose of this research was to analyze the difference in difficulties of generating ideas according to individual learning styles. A total of 375 technical students from four technical universities in Malaysia were randomly selected as samples. The Kolb Learning Styles Inventory and a set of developed questionnaires were used in this research. The results showed that the most dominant learning style is among technical students is Doer. A total of 319 (85.1%) technical students faced difficulties in solving individual assignments. Most of the problem faced by technical students is the difficulty of generating ideas for solving individual assignments. There was no significant difference in difficulties of generating ideas according to students’ learning styles. Therefore, students need to learn higher order thinking skills enabling students to generate ideas and consequently complete assignments.

Keywords: difference, difficulties, generating idea, learning styles, Kolb Learning Styles Inventory

Procedia PDF Downloads 426

Authors: R. Zh. Abdukerim, D. A. Absatarova, A. T. Aitbayeva, M. A. Askarova, S. T. Turuspekova, E. V. Zhunus

Abstract:

The resilience of agricultural systems at the global level to climate change and their ability to recover determines the prospects for food security on a global scale. Since climate change will lead to changes in temperatures, precipitation, weather conditions and mass outbreaks of harmful organisms. The issue of adaptation to climate change in the agricultural sector is one of the priorities of Kazakhstan's Development Strategy for the period up to 2050. Since Kazakhstan is an agroindustrial country in which agriculture plays an important economic role. Kazakhstan is the largest potato producer in Central Asia, accounting for about 60% of the total vegetable production, which determines the urgency of solving the problem of increasing yields and quality. The control harmful organisms plays an important role in solving this issue. Due to the fact that climate change can lead to an increase in the number of harmful organisms and, accordingly, to a complete loss of harvest.

Keywords: potato pests, Colorado potato beetle, soil pests, global climate change

Procedia PDF Downloads 43

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a new hybrid particle swarm optimization algorithm is proposed for the multi-objective flexible job shop scheduling problem that is very important and hard combinatorial problem. The Pareto approach is used for solving the multi-objective problem. Several new local search heuristics are integrated into an algorithm based on the critical block concept to enhance the performance of the algorithm. The algorithm is compared with the recently published multi-objective algorithms based on benchmarks selected from the literature. Several metrics are used for quantifying performance and comparison of the achieved solutions. The algorithms are also compared based on the Weighting summation of objectives approach. The proposed algorithm can find the Pareto solutions more efficiently than the compared algorithms in less computational time.

Keywords: swarm-based optimization, local search, Pareto optimality, flexible job shop scheduling, multi-objective optimization

Procedia PDF Downloads 352